/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 00:30:19,315 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 00:30:19,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 00:30:19,393 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 00:30:19,393 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 00:30:19,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 00:30:19,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 00:30:19,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 00:30:19,416 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 00:30:19,419 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 00:30:19,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 00:30:19,420 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 00:30:19,420 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 00:30:19,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 00:30:19,421 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 00:30:19,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 00:30:19,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 00:30:19,422 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 00:30:19,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 00:30:19,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 00:30:19,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 00:30:19,423 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 00:30:19,423 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 00:30:19,423 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 00:30:19,424 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 00:30:19,424 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 00:30:19,424 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 00:30:19,424 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 00:30:19,425 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 00:30:19,425 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 00:30:19,425 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 00:30:19,426 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 00:30:19,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:30:19,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 00:30:19,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 00:30:19,426 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 00:30:19,426 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 00:30:19,426 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 00:30:19,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 00:30:19,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 00:30:19,427 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 00:30:19,427 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 00:30:19,427 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 00:30:19,427 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-16 00:30:19,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 00:30:19,644 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 00:30:19,646 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 00:30:19,647 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 00:30:19,647 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 00:30:19,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c [2023-12-16 00:30:20,627 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 00:30:20,782 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 00:30:20,782 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c [2023-12-16 00:30:20,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8821b108/f965213a1082474ebc6aff827c7e4804/FLAGf6b9d961f [2023-12-16 00:30:21,187 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8821b108/f965213a1082474ebc6aff827c7e4804 [2023-12-16 00:30:21,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 00:30:21,189 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 00:30:21,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 00:30:21,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 00:30:21,195 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 00:30:21,195 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,196 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64c57bea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21, skipping insertion in model container [2023-12-16 00:30:21,196 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,215 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 00:30:21,329 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c[755,768] [2023-12-16 00:30:21,377 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:30:21,385 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 00:30:21,392 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/bitvector/soft_float_1-2a.c.cil.c[755,768] [2023-12-16 00:30:21,411 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 00:30:21,421 INFO L206 MainTranslator]: Completed translation [2023-12-16 00:30:21,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21 WrapperNode [2023-12-16 00:30:21,422 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 00:30:21,423 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 00:30:21,423 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 00:30:21,423 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 00:30:21,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,433 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,450 INFO L138 Inliner]: procedures = 17, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 174 [2023-12-16 00:30:21,450 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 00:30:21,451 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 00:30:21,451 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 00:30:21,451 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 00:30:21,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,469 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 00:30:21,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,469 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,472 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,475 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,479 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 00:30:21,480 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 00:30:21,480 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 00:30:21,480 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 00:30:21,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (1/1) ... [2023-12-16 00:30:21,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 00:30:21,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:30:21,548 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 00:30:21,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 00:30:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 00:30:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 00:30:21,573 INFO L130 BoogieDeclarations]: Found specification of procedure base2flt [2023-12-16 00:30:21,574 INFO L138 BoogieDeclarations]: Found implementation of procedure base2flt [2023-12-16 00:30:21,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 00:30:21,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 00:30:21,575 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 00:30:21,575 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 00:30:21,647 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 00:30:21,649 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 00:30:21,952 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 00:30:21,973 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 00:30:21,973 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 00:30:21,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:30:21 BoogieIcfgContainer [2023-12-16 00:30:21,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 00:30:21,975 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 00:30:21,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 00:30:21,977 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 00:30:21,977 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:30:21" (1/3) ... [2023-12-16 00:30:21,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75780ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:30:21, skipping insertion in model container [2023-12-16 00:30:21,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:30:21" (2/3) ... [2023-12-16 00:30:21,978 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75780ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:30:21, skipping insertion in model container [2023-12-16 00:30:21,978 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:30:21" (3/3) ... [2023-12-16 00:30:21,979 INFO L112 eAbstractionObserver]: Analyzing ICFG soft_float_1-2a.c.cil.c [2023-12-16 00:30:21,991 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 00:30:21,991 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 00:30:22,025 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 00:30:22,030 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@75b78389, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 00:30:22,030 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 00:30:22,033 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 59 states have internal predecessors, (92), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-16 00:30:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-16 00:30:22,039 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:22,040 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:22,040 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:22,044 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:22,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1870388766, now seen corresponding path program 1 times [2023-12-16 00:30:22,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:22,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659193372] [2023-12-16 00:30:22,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:22,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:22,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:22,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:30:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:22,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 00:30:22,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:22,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659193372] [2023-12-16 00:30:22,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659193372] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:30:22,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121152798] [2023-12-16 00:30:22,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:22,522 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:30:22,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:30:22,524 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:30:22,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-16 00:30:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:22,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 22 conjunts are in the unsatisfiable core [2023-12-16 00:30:22,619 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:30:22,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 00:30:22,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:30:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 00:30:22,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121152798] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:30:22,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:30:22,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 8] total 16 [2023-12-16 00:30:22,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881999853] [2023-12-16 00:30:22,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:30:22,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 00:30:22,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:22,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 00:30:22,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2023-12-16 00:30:22,879 INFO L87 Difference]: Start difference. First operand has 68 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 59 states have internal predecessors, (92), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 00:30:23,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:23,241 INFO L93 Difference]: Finished difference Result 188 states and 320 transitions. [2023-12-16 00:30:23,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 00:30:23,248 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2023-12-16 00:30:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:23,254 INFO L225 Difference]: With dead ends: 188 [2023-12-16 00:30:23,254 INFO L226 Difference]: Without dead ends: 119 [2023-12-16 00:30:23,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=500, Unknown=0, NotChecked=0, Total=600 [2023-12-16 00:30:23,258 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 116 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:23,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 932 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 00:30:23,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-16 00:30:23,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2023-12-16 00:30:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.475609756097561) internal successors, (121), 85 states have internal predecessors, (121), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-16 00:30:23,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 148 transitions. [2023-12-16 00:30:23,288 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 148 transitions. Word has length 28 [2023-12-16 00:30:23,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:23,288 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 148 transitions. [2023-12-16 00:30:23,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 14 states have internal predecessors, (29), 4 states have call successors, (5), 2 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-12-16 00:30:23,289 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 148 transitions. [2023-12-16 00:30:23,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-16 00:30:23,290 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:23,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:23,295 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-16 00:30:23,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-16 00:30:23,494 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:23,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:23,495 INFO L85 PathProgramCache]: Analyzing trace with hash 377339095, now seen corresponding path program 1 times [2023-12-16 00:30:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:23,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330140135] [2023-12-16 00:30:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:23,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:23,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 00:30:23,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 00:30:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:23,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330140135] [2023-12-16 00:30:23,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330140135] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-16 00:30:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876507408] [2023-12-16 00:30:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 00:30:23,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 00:30:23,649 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-16 00:30:23,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-16 00:30:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:23,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 31 conjunts are in the unsatisfiable core [2023-12-16 00:30:23,710 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 00:30:23,761 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-16 00:30:23,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 00:30:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 00:30:23,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876507408] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 00:30:23,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-16 00:30:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 11] total 18 [2023-12-16 00:30:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521951207] [2023-12-16 00:30:23,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-16 00:30:23,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 00:30:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 00:30:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2023-12-16 00:30:23,988 INFO L87 Difference]: Start difference. First operand 98 states and 148 transitions. Second operand has 18 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-16 00:30:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:24,355 INFO L93 Difference]: Finished difference Result 206 states and 317 transitions. [2023-12-16 00:30:24,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-16 00:30:24,355 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 32 [2023-12-16 00:30:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:24,357 INFO L225 Difference]: With dead ends: 206 [2023-12-16 00:30:24,357 INFO L226 Difference]: Without dead ends: 142 [2023-12-16 00:30:24,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=167, Invalid=825, Unknown=0, NotChecked=0, Total=992 [2023-12-16 00:30:24,359 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 187 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:24,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 800 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 00:30:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-12-16 00:30:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 98. [2023-12-16 00:30:24,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 82 states have (on average 1.4268292682926829) internal successors, (117), 85 states have internal predecessors, (117), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 11 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-16 00:30:24,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2023-12-16 00:30:24,368 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 32 [2023-12-16 00:30:24,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:24,368 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2023-12-16 00:30:24,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.5) internal successors, (35), 15 states have internal predecessors, (35), 5 states have call successors, (6), 2 states have call predecessors, (6), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-16 00:30:24,368 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2023-12-16 00:30:24,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 00:30:24,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:24,370 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:24,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 00:30:24,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-16 00:30:24,575 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:24,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:24,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1672245559, now seen corresponding path program 1 times [2023-12-16 00:30:24,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:24,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18228824] [2023-12-16 00:30:24,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:24,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:24,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:24,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 00:30:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 00:30:24,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:24,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18228824] [2023-12-16 00:30:24,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18228824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:30:24,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:30:24,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 00:30:24,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659103311] [2023-12-16 00:30:24,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:30:24,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 00:30:24,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:24,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 00:30:24,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:30:24,680 INFO L87 Difference]: Start difference. First operand 98 states and 144 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:24,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:24,731 INFO L93 Difference]: Finished difference Result 224 states and 334 transitions. [2023-12-16 00:30:24,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 00:30:24,731 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-16 00:30:24,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:24,735 INFO L225 Difference]: With dead ends: 224 [2023-12-16 00:30:24,735 INFO L226 Difference]: Without dead ends: 164 [2023-12-16 00:30:24,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:30:24,739 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 50 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:24,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 412 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:30:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-16 00:30:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 160. [2023-12-16 00:30:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 138 states have (on average 1.4057971014492754) internal successors, (194), 141 states have internal predecessors, (194), 17 states have call successors, (17), 3 states have call predecessors, (17), 4 states have return successors, (22), 19 states have call predecessors, (22), 16 states have call successors, (22) [2023-12-16 00:30:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 233 transitions. [2023-12-16 00:30:24,766 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 233 transitions. Word has length 36 [2023-12-16 00:30:24,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:24,766 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 233 transitions. [2023-12-16 00:30:24,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 233 transitions. [2023-12-16 00:30:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-16 00:30:24,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:24,772 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:24,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 00:30:24,772 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:24,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:24,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1942663367, now seen corresponding path program 1 times [2023-12-16 00:30:24,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:24,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018601112] [2023-12-16 00:30:24,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:24,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:24,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:24,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 00:30:24,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:24,889 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-12-16 00:30:24,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:24,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018601112] [2023-12-16 00:30:24,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018601112] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:30:24,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:30:24,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 00:30:24,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13686438] [2023-12-16 00:30:24,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:30:24,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 00:30:24,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:24,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 00:30:24,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 00:30:24,895 INFO L87 Difference]: Start difference. First operand 160 states and 233 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:24,954 INFO L93 Difference]: Finished difference Result 208 states and 303 transitions. [2023-12-16 00:30:24,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 00:30:24,955 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2023-12-16 00:30:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:24,956 INFO L225 Difference]: With dead ends: 208 [2023-12-16 00:30:24,956 INFO L226 Difference]: Without dead ends: 154 [2023-12-16 00:30:24,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-16 00:30:24,959 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 37 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:24,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 484 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:30:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-16 00:30:24,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 150. [2023-12-16 00:30:24,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 130 states have (on average 1.3846153846153846) internal successors, (180), 133 states have internal predecessors, (180), 15 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (20), 17 states have call predecessors, (20), 14 states have call successors, (20) [2023-12-16 00:30:24,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 215 transitions. [2023-12-16 00:30:24,972 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 215 transitions. Word has length 36 [2023-12-16 00:30:24,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:24,973 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 215 transitions. [2023-12-16 00:30:24,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:24,973 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 215 transitions. [2023-12-16 00:30:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-16 00:30:24,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:24,975 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:24,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 00:30:24,975 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:24,975 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1434650185, now seen corresponding path program 1 times [2023-12-16 00:30:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:24,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194158415] [2023-12-16 00:30:24,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:24,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:24,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:30:25,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,028 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:30:25,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:25,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194158415] [2023-12-16 00:30:25,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194158415] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:30:25,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:30:25,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:30:25,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179764371] [2023-12-16 00:30:25,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:30:25,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:30:25,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:25,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:30:25,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:30:25,037 INFO L87 Difference]: Start difference. First operand 150 states and 215 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:25,057 INFO L93 Difference]: Finished difference Result 198 states and 287 transitions. [2023-12-16 00:30:25,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:30:25,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 38 [2023-12-16 00:30:25,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:25,059 INFO L225 Difference]: With dead ends: 198 [2023-12-16 00:30:25,059 INFO L226 Difference]: Without dead ends: 156 [2023-12-16 00:30:25,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:30:25,060 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 47 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:25,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 283 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:30:25,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2023-12-16 00:30:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 130. [2023-12-16 00:30:25,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 115 states have internal predecessors, (153), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-16 00:30:25,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 180 transitions. [2023-12-16 00:30:25,065 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 180 transitions. Word has length 38 [2023-12-16 00:30:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:25,066 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 180 transitions. [2023-12-16 00:30:25,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 180 transitions. [2023-12-16 00:30:25,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 00:30:25,068 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:25,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:25,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 00:30:25,068 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:25,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:25,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1087292815, now seen corresponding path program 1 times [2023-12-16 00:30:25,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:25,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664315229] [2023-12-16 00:30:25,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:25,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:25,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:30:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,118 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:30:25,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:25,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664315229] [2023-12-16 00:30:25,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664315229] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:30:25,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:30:25,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:30:25,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040301735] [2023-12-16 00:30:25,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:30:25,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:30:25,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:25,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:30:25,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:30:25,120 INFO L87 Difference]: Start difference. First operand 130 states and 180 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:25,134 INFO L93 Difference]: Finished difference Result 147 states and 201 transitions. [2023-12-16 00:30:25,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 00:30:25,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-12-16 00:30:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:25,135 INFO L225 Difference]: With dead ends: 147 [2023-12-16 00:30:25,135 INFO L226 Difference]: Without dead ends: 140 [2023-12-16 00:30:25,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:30:25,136 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 17 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:25,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 284 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:30:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-12-16 00:30:25,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2023-12-16 00:30:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 118 states have (on average 1.3305084745762712) internal successors, (157), 119 states have internal predecessors, (157), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-16 00:30:25,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 184 transitions. [2023-12-16 00:30:25,140 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 184 transitions. Word has length 39 [2023-12-16 00:30:25,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:25,141 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 184 transitions. [2023-12-16 00:30:25,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,141 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 184 transitions. [2023-12-16 00:30:25,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-16 00:30:25,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:25,141 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:25,141 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 00:30:25,142 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:25,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:25,142 INFO L85 PathProgramCache]: Analyzing trace with hash 687714547, now seen corresponding path program 1 times [2023-12-16 00:30:25,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:25,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791529791] [2023-12-16 00:30:25,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:25,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:25,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:25,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-16 00:30:25,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,176 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:30:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791529791] [2023-12-16 00:30:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791529791] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:30:25,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:30:25,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 00:30:25,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593799854] [2023-12-16 00:30:25,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:30:25,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 00:30:25,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:25,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 00:30:25,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:30:25,178 INFO L87 Difference]: Start difference. First operand 134 states and 184 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:25,208 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2023-12-16 00:30:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:30:25,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2023-12-16 00:30:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:25,209 INFO L225 Difference]: With dead ends: 141 [2023-12-16 00:30:25,210 INFO L226 Difference]: Without dead ends: 134 [2023-12-16 00:30:25,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 00:30:25,210 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 5 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:25,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 366 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:30:25,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-12-16 00:30:25,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 130. [2023-12-16 00:30:25,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 114 states have (on average 1.3157894736842106) internal successors, (150), 115 states have internal predecessors, (150), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-16 00:30:25,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 177 transitions. [2023-12-16 00:30:25,216 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 177 transitions. Word has length 39 [2023-12-16 00:30:25,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:25,217 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 177 transitions. [2023-12-16 00:30:25,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,218 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 177 transitions. [2023-12-16 00:30:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 00:30:25,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:25,220 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:25,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 00:30:25,220 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:25,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:25,221 INFO L85 PathProgramCache]: Analyzing trace with hash 676150810, now seen corresponding path program 1 times [2023-12-16 00:30:25,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:25,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120915242] [2023-12-16 00:30:25,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:25,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-16 00:30:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-16 00:30:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-16 00:30:25,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 00:30:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-16 00:30:25,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 00:30:25,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120915242] [2023-12-16 00:30:25,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120915242] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 00:30:25,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 00:30:25,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 00:30:25,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355771991] [2023-12-16 00:30:25,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 00:30:25,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 00:30:25,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 00:30:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 00:30:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 00:30:25,283 INFO L87 Difference]: Start difference. First operand 130 states and 177 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 00:30:25,305 INFO L93 Difference]: Finished difference Result 207 states and 286 transitions. [2023-12-16 00:30:25,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 00:30:25,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-12-16 00:30:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 00:30:25,306 INFO L225 Difference]: With dead ends: 207 [2023-12-16 00:30:25,306 INFO L226 Difference]: Without dead ends: 167 [2023-12-16 00:30:25,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 00:30:25,307 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 78 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 00:30:25,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 284 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 00:30:25,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-12-16 00:30:25,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2023-12-16 00:30:25,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 123 states have (on average 1.3089430894308942) internal successors, (161), 123 states have internal predecessors, (161), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (16), 13 states have call predecessors, (16), 10 states have call successors, (16) [2023-12-16 00:30:25,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 188 transitions. [2023-12-16 00:30:25,313 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 188 transitions. Word has length 40 [2023-12-16 00:30:25,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 00:30:25,313 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 188 transitions. [2023-12-16 00:30:25,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-16 00:30:25,313 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 188 transitions. [2023-12-16 00:30:25,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-12-16 00:30:25,315 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 00:30:25,315 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:25,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 00:30:25,315 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 00:30:25,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 00:30:25,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1680913172, now seen corresponding path program 2 times [2023-12-16 00:30:25,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 00:30:25,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923141204] [2023-12-16 00:30:25,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 00:30:25,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 00:30:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 00:30:25,340 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 00:30:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 00:30:25,370 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 00:30:25,371 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 00:30:25,371 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 00:30:25,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 00:30:25,375 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 00:30:25,377 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 00:30:25,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:30:25 BoogieIcfgContainer [2023-12-16 00:30:25,420 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 00:30:25,420 INFO L158 Benchmark]: Toolchain (without parser) took 4230.74ms. Allocated memory was 210.8MB in the beginning and 287.3MB in the end (delta: 76.5MB). Free memory was 176.4MB in the beginning and 222.2MB in the end (delta: -45.8MB). Peak memory consumption was 31.7MB. Max. memory is 8.0GB. [2023-12-16 00:30:25,420 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 210.8MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:30:25,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.12ms. Allocated memory is still 210.8MB. Free memory was 176.0MB in the beginning and 161.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 00:30:25,421 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.57ms. Allocated memory is still 210.8MB. Free memory was 161.7MB in the beginning and 159.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:30:25,421 INFO L158 Benchmark]: Boogie Preprocessor took 28.08ms. Allocated memory is still 210.8MB. Free memory was 159.6MB in the beginning and 157.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 00:30:25,421 INFO L158 Benchmark]: RCFGBuilder took 494.17ms. Allocated memory is still 210.8MB. Free memory was 157.1MB in the beginning and 138.6MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 00:30:25,421 INFO L158 Benchmark]: TraceAbstraction took 3444.75ms. Allocated memory was 210.8MB in the beginning and 287.3MB in the end (delta: 76.5MB). Free memory was 138.0MB in the beginning and 222.2MB in the end (delta: -84.2MB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 00:30:25,423 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 210.8MB. Free memory is still 166.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 232.12ms. Allocated memory is still 210.8MB. Free memory was 176.0MB in the beginning and 161.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.57ms. Allocated memory is still 210.8MB. Free memory was 161.7MB in the beginning and 159.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.08ms. Allocated memory is still 210.8MB. Free memory was 159.6MB in the beginning and 157.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 494.17ms. Allocated memory is still 210.8MB. Free memory was 157.1MB in the beginning and 138.6MB in the end (delta: 18.5MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 3444.75ms. Allocated memory was 210.8MB in the beginning and 287.3MB in the end (delta: 76.5MB). Free memory was 138.0MB in the beginning and 222.2MB in the end (delta: -84.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 18]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwise operation at line 109. Possible FailurePath: [L227] unsigned int a ; [L228] unsigned int ma = __VERIFIER_nondet_uint(); [L229] signed char ea = __VERIFIER_nondet_char(); [L230] unsigned int b ; [L231] unsigned int mb = __VERIFIER_nondet_uint(); [L232] signed char eb = __VERIFIER_nondet_char(); [L233] unsigned int r_add ; [L234] unsigned int zero ; [L235] int sa ; [L236] int sb ; [L237] int tmp ; [L238] int tmp___0 ; [L239] int tmp___1 ; [L240] int tmp___2 ; [L241] int tmp___3 ; [L242] int tmp___4 ; [L243] int tmp___5 ; [L244] int tmp___6 ; [L245] int tmp___7 ; [L246] int tmp___8 ; [L247] int tmp___9 ; [L248] int __retres23 ; VAL [ea=0, eb=0] [L252] CALL, EXPR base2flt(0, 0) VAL [\old(e)=0, \old(m)=0] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=0, e=0, m=0] [L30] COND TRUE ! m [L31] __retres4 = 0U VAL [\old(e)=0, \old(m)=0, __retres4=0, e=0, m=0] [L81] return (__retres4); [L252] RET, EXPR base2flt(0, 0) VAL [ea=0, eb=0] [L252] zero = base2flt(0, 0) [L253] CALL, EXPR base2flt(ma, ea) VAL [\old(e)=0, \old(m)=1] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L30] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L36] COND FALSE !(m < 1U << 24U) [L58] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L60] COND FALSE !(m >= 1U << 25U) [L77] m = m & ~ (1U << 24U) [L78] res = m | ((unsigned int ) (e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=1, e=0, m=2, res=1] [L81] return (__retres4); [L253] RET, EXPR base2flt(ma, ea) VAL [ea=0, eb=0, ma=1, zero=0] [L253] a = base2flt(ma, ea) [L254] CALL, EXPR base2flt(mb, eb) VAL [\old(e)=0, \old(m)=1] [L26] unsigned int res ; [L27] unsigned int __retres4 ; VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L30] COND FALSE !(! m) VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L36] COND FALSE !(m < 1U << 24U) [L58] COND TRUE 1 VAL [\old(e)=0, \old(m)=1, e=0, m=1] [L60] COND FALSE !(m >= 1U << 25U) [L77] m = m & ~ (1U << 24U) [L78] res = m | ((unsigned int ) (e + 128) << 24U) [L79] __retres4 = res VAL [\old(e)=0, \old(m)=1, __retres4=4294967295, e=0, m=3, res=4294967295] [L81] return (__retres4); [L254] RET, EXPR base2flt(mb, eb) VAL [a=1, ea=0, eb=0, ma=1, mb=1, zero=0] [L254] b = base2flt(mb, eb) [L256] COND FALSE !(a < zero) VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, zero=0] [L259] COND TRUE a > zero [L260] tmp = 1 VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, tmp=1, zero=0] [L264] sa = tmp VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, tmp=1, zero=0] [L266] COND FALSE !(b < zero) VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, tmp=1, zero=0] [L269] COND TRUE b > zero [L270] tmp___0 = 1 VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, tmp=1, tmp___0=1, zero=0] [L274] sb = tmp___0 VAL [a=1, b=4294967295, ea=0, eb=0, ma=1, mb=1, sa=1, sb=1, tmp=1, tmp___0=1, zero=0] [L277] CALL addflt(a, b) [L85] unsigned int res ; [L86] unsigned int ma ; [L87] unsigned int mb ; [L88] unsigned int delta ; [L89] int ea ; [L90] int eb ; [L91] unsigned int tmp ; [L92] unsigned int __retres10 ; VAL [\old(a)=1, \old(b)=4294967295, a=1, b=4294967295] [L95] COND TRUE a < b [L96] tmp = a [L97] a = b [L98] b = tmp VAL [\old(a)=1, \old(b)=4294967295, a=4294967295, b=1, tmp=1] [L102] COND FALSE !(! b) [L109] ma = a & ((1U << 24U) - 1U) [L110] ea = (int )(a >> 24U) - 128 [L111] ma = ma | (1U << 24U) [L112] mb = b & ((1U << 24U) - 1U) [L113] eb = (int )(b >> 24U) - 128 [L114] mb = mb | (1U << 24U) [L115] CALL __VERIFIER_assert(ea >= eb) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 68 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 9, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 550 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 537 mSDsluCounter, 3845 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3123 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 947 IncrementalHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 722 mSDtfsCounter, 947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160occurred in iteration=3, InterpolantAutomatonStates: 69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 137 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 396 ConstructedInterpolants, 0 QuantifiedInterpolants, 710 SizeOfPredicates, 9 NumberOfNonLiveVariables, 254 ConjunctsInSsa, 53 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 118/144 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-16 00:30:25,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...