/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-13.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:06:02,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:06:02,635 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-15 21:06:02,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:06:02,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:06:02,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:06:02,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:06:02,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:06:02,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:06:02,653 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:06:02,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:06:02,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:06:02,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:06:02,654 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:06:02,654 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:06:02,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:06:02,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:06:02,655 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:06:02,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:06:02,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:06:02,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:06:02,656 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:06:02,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:06:02,656 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:06:02,656 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:06:02,657 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:06:02,657 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:06:02,657 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:06:02,657 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:06:02,657 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:06:02,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:06:02,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:06:02,658 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:06:02,658 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:06:02,658 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:06:02,659 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:06:02,659 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:06:02,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:06:02,659 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:06:02,659 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:06:02,660 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:06:02,660 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:06:02,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:06:02,660 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 -> true [2023-12-15 21:06:02,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:06:02,848 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:06:02,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:06:02,851 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:06:02,851 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:06:02,852 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2023-12-15 21:06:03,773 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:06:03,947 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:06:03,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-13.i [2023-12-15 21:06:03,955 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620f71251/18cc3d2774b743a2bb0b64db9b46d9c5/FLAGf1637df72 [2023-12-15 21:06:03,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/620f71251/18cc3d2774b743a2bb0b64db9b46d9c5 [2023-12-15 21:06:03,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:06:03,973 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:06:03,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:06:03,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:06:03,978 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:06:03,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:06:03" (1/1) ... [2023-12-15 21:06:03,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b57ac59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:03, skipping insertion in model container [2023-12-15 21:06:03,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:06:03" (1/1) ... [2023-12-15 21:06:03,997 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:06:04,118 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-13.i[915,928] [2023-12-15 21:06:04,157 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:06:04,184 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:06:04,194 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount10_file-13.i[915,928] [2023-12-15 21:06:04,216 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:06:04,226 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:06:04,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04 WrapperNode [2023-12-15 21:06:04,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:06:04,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:06:04,228 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:06:04,228 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:06:04,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,240 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,266 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 96 [2023-12-15 21:06:04,266 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:06:04,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:06:04,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:06:04,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:06:04,274 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,298 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-15 21:06:04,298 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,298 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,305 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,310 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:06:04,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:06:04,310 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:06:04,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:06:04,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (1/1) ... [2023-12-15 21:06:04,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:06:04,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:06:04,330 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-15 21:06:04,342 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-15 21:06:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:06:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:06:04,354 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:06:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:06:04,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:06:04,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:06:04,401 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:06:04,403 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:06:04,535 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:06:04,557 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:06:04,557 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:06:04,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:06:04 BoogieIcfgContainer [2023-12-15 21:06:04,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:06:04,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:06:04,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:06:04,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:06:04,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:06:03" (1/3) ... [2023-12-15 21:06:04,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561dad05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:06:04, skipping insertion in model container [2023-12-15 21:06:04,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:06:04" (2/3) ... [2023-12-15 21:06:04,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@561dad05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:06:04, skipping insertion in model container [2023-12-15 21:06:04,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:06:04" (3/3) ... [2023-12-15 21:06:04,563 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount10_file-13.i [2023-12-15 21:06:04,574 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:06:04,575 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:06:04,603 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:06:04,607 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;@417a6b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:06:04,607 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:06:04,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:06:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:06:04,617 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:04,618 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:04,618 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:04,622 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash 669682152, now seen corresponding path program 1 times [2023-12-15 21:06:04,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:04,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563550396] [2023-12-15 21:06:04,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:04,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:04,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:04,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:04,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:04,865 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:06:04,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:04,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563550396] [2023-12-15 21:06:04,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563550396] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:04,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:04,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:06:04,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493071591] [2023-12-15 21:06:04,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:04,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:06:04,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:04,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:06:04,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:06:04,897 INFO L87 Difference]: Start difference. First operand has 39 states, 24 states have (on average 1.4583333333333333) internal successors, (35), 25 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:06:04,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:04,923 INFO L93 Difference]: Finished difference Result 75 states and 128 transitions. [2023-12-15 21:06:04,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:06:04,925 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 74 [2023-12-15 21:06:04,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:04,936 INFO L225 Difference]: With dead ends: 75 [2023-12-15 21:06:04,936 INFO L226 Difference]: Without dead ends: 37 [2023-12-15 21:06:04,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:06:04,940 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:04,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-12-15 21:06:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-12-15 21:06:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:06:04,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 54 transitions. [2023-12-15 21:06:04,982 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 54 transitions. Word has length 74 [2023-12-15 21:06:04,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:04,982 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 54 transitions. [2023-12-15 21:06:04,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-15 21:06:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 54 transitions. [2023-12-15 21:06:04,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-12-15 21:06:04,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:04,985 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:04,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:06:04,985 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:04,988 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:04,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1178377752, now seen corresponding path program 1 times [2023-12-15 21:06:04,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:04,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753943667] [2023-12-15 21:06:04,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:04,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:05,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:05,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:05,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:05,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:05,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:05,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:05,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:06:05,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:05,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753943667] [2023-12-15 21:06:05,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753943667] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:05,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:05,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:06:05,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094469978] [2023-12-15 21:06:05,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:05,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:06:05,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:05,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:06:05,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:06:05,187 INFO L87 Difference]: Start difference. First operand 37 states and 54 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:05,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:05,207 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2023-12-15 21:06:05,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-15 21:06:05,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 74 [2023-12-15 21:06:05,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:05,208 INFO L225 Difference]: With dead ends: 41 [2023-12-15 21:06:05,209 INFO L226 Difference]: Without dead ends: 39 [2023-12-15 21:06:05,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:06:05,210 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:05,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 145 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:05,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-12-15 21:06:05,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-12-15 21:06:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:06:05,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2023-12-15 21:06:05,215 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 74 [2023-12-15 21:06:05,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:05,216 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2023-12-15 21:06:05,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2023-12-15 21:06:05,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-12-15 21:06:05,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:05,217 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:05,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:06:05,218 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:05,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:05,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1133360237, now seen corresponding path program 1 times [2023-12-15 21:06:05,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488783584] [2023-12-15 21:06:05,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:05,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:05,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:05,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:05,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:05,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:05,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:05,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,285 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:06:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488783584] [2023-12-15 21:06:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488783584] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:05,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:05,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:05,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374507883] [2023-12-15 21:06:05,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:05,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:05,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:05,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:05,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:05,287 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:05,304 INFO L93 Difference]: Finished difference Result 81 states and 116 transitions. [2023-12-15 21:06:05,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:05,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 76 [2023-12-15 21:06:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:05,305 INFO L225 Difference]: With dead ends: 81 [2023-12-15 21:06:05,305 INFO L226 Difference]: Without dead ends: 43 [2023-12-15 21:06:05,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:05,306 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 4 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:05,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:05,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-12-15 21:06:05,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2023-12-15 21:06:05,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-15 21:06:05,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-12-15 21:06:05,311 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 76 [2023-12-15 21:06:05,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:05,312 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-12-15 21:06:05,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:05,312 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-12-15 21:06:05,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 21:06:05,313 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:05,313 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:05,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:06:05,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:05,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:05,313 INFO L85 PathProgramCache]: Analyzing trace with hash -197702413, now seen corresponding path program 1 times [2023-12-15 21:06:05,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:05,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780837805] [2023-12-15 21:06:05,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:05,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:05,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:05,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:05,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:05,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:05,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:06:05,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:05,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780837805] [2023-12-15 21:06:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780837805] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:05,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:05,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-15 21:06:05,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257851647] [2023-12-15 21:06:05,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:05,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 21:06:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:05,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 21:06:05,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-15 21:06:05,950 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:06,182 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2023-12-15 21:06:06,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-15 21:06:06,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-12-15 21:06:06,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:06,190 INFO L225 Difference]: With dead ends: 66 [2023-12-15 21:06:06,190 INFO L226 Difference]: Without dead ends: 64 [2023-12-15 21:06:06,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-15 21:06:06,197 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 31 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:06,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 308 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:06:06,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-12-15 21:06:06,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 59. [2023-12-15 21:06:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.2619047619047619) internal successors, (53), 43 states have internal predecessors, (53), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:06:06,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2023-12-15 21:06:06,205 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 78 [2023-12-15 21:06:06,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:06,205 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2023-12-15 21:06:06,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2023-12-15 21:06:06,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 21:06:06,206 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:06,206 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:06,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:06:06,207 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:06,207 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash -195855371, now seen corresponding path program 1 times [2023-12-15 21:06:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:06,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619356220] [2023-12-15 21:06:06,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:06,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:06,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:06,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:06,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:06:06,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619356220] [2023-12-15 21:06:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619356220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954538725] [2023-12-15 21:06:06,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:06,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:06,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:06,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:06,278 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:06,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:06,318 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2023-12-15 21:06:06,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:06,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-12-15 21:06:06,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:06,325 INFO L225 Difference]: With dead ends: 137 [2023-12-15 21:06:06,325 INFO L226 Difference]: Without dead ends: 79 [2023-12-15 21:06:06,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:06,330 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 100 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-15 21:06:06,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 100 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:06,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-15 21:06:06,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2023-12-15 21:06:06,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 56 states have internal predecessors, (66), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:06:06,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2023-12-15 21:06:06,338 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 78 [2023-12-15 21:06:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:06,338 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2023-12-15 21:06:06,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2023-12-15 21:06:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 21:06:06,339 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:06,339 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:06,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:06:06,340 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:06,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash 482355957, now seen corresponding path program 1 times [2023-12-15 21:06:06,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:06,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089370021] [2023-12-15 21:06:06,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:06,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:06:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-15 21:06:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-15 21:06:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-15 21:06:06,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-15 21:06:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-15 21:06:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-15 21:06:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-15 21:06:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-15 21:06:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-15 21:06:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-15 21:06:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-15 21:06:06,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:06:06,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-15 21:06:06,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:06:06,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089370021] [2023-12-15 21:06:06,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089370021] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:06:06,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:06:06,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:06:06,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562180877] [2023-12-15 21:06:06,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:06:06,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:06:06,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:06:06,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:06:06,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:06,405 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:06:06,432 INFO L93 Difference]: Finished difference Result 167 states and 221 transitions. [2023-12-15 21:06:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:06:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 78 [2023-12-15 21:06:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:06:06,433 INFO L225 Difference]: With dead ends: 167 [2023-12-15 21:06:06,433 INFO L226 Difference]: Without dead ends: 92 [2023-12-15 21:06:06,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:06:06,436 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:06:06,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 93 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:06:06,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-15 21:06:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 73. [2023-12-15 21:06:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 51 states have (on average 1.196078431372549) internal successors, (61), 53 states have internal predecessors, (61), 18 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-15 21:06:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 97 transitions. [2023-12-15 21:06:06,456 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 97 transitions. Word has length 78 [2023-12-15 21:06:06,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:06:06,457 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 97 transitions. [2023-12-15 21:06:06,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-15 21:06:06,457 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 97 transitions. [2023-12-15 21:06:06,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2023-12-15 21:06:06,461 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:06:06,461 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:06,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-15 21:06:06,462 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:06:06,462 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:06:06,462 INFO L85 PathProgramCache]: Analyzing trace with hash 484202999, now seen corresponding path program 1 times [2023-12-15 21:06:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:06:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632801665] [2023-12-15 21:06:06,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:06:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:06:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:06:06,493 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:06:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:06:06,530 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:06:06,530 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:06:06,531 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:06:06,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-15 21:06:06,535 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-12-15 21:06:06,538 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:06:06,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:06:06 BoogieIcfgContainer [2023-12-15 21:06:06,587 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:06:06,587 INFO L158 Benchmark]: Toolchain (without parser) took 2614.30ms. Allocated memory is still 300.9MB. Free memory was 260.3MB in the beginning and 139.4MB in the end (delta: 120.9MB). Peak memory consumption was 121.6MB. Max. memory is 8.0GB. [2023-12-15 21:06:06,588 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 204.5MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:06:06,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.77ms. Allocated memory is still 300.9MB. Free memory was 260.0MB in the beginning and 248.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 21:06:06,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 300.9MB. Free memory was 248.5MB in the beginning and 246.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:06:06,588 INFO L158 Benchmark]: Boogie Preprocessor took 43.42ms. Allocated memory is still 300.9MB. Free memory was 246.4MB in the beginning and 244.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 21:06:06,588 INFO L158 Benchmark]: RCFGBuilder took 247.14ms. Allocated memory is still 300.9MB. Free memory was 244.3MB in the beginning and 230.3MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-15 21:06:06,588 INFO L158 Benchmark]: TraceAbstraction took 2028.37ms. Allocated memory is still 300.9MB. Free memory was 229.6MB in the beginning and 139.4MB in the end (delta: 90.2MB). Peak memory consumption was 91.2MB. Max. memory is 8.0GB. [2023-12-15 21:06:06,590 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.40ms. Allocated memory is still 204.5MB. Free memory is still 155.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.77ms. Allocated memory is still 300.9MB. Free memory was 260.0MB in the beginning and 248.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 300.9MB. Free memory was 248.5MB in the beginning and 246.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 43.42ms. Allocated memory is still 300.9MB. Free memory was 246.4MB in the beginning and 244.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 247.14ms. Allocated memory is still 300.9MB. Free memory was 244.3MB in the beginning and 230.3MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 2028.37ms. Allocated memory is still 300.9MB. Free memory was 229.6MB in the beginning and 139.4MB in the end (delta: 90.2MB). Peak memory consumption was 91.2MB. 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: 19]: 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 shiftRight at line 69. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 1; [L24] unsigned short int var_1_3 = 256; [L25] signed long int var_1_4 = 500; [L26] signed char var_1_5 = 16; [L27] unsigned char var_1_6 = 1; [L28] unsigned char var_1_7 = 1; [L73] isInitial = 1 [L74] FCALL initially() [L75] COND TRUE 1 [L76] FCALL updateLastVariables() [L77] CALL updateVariables() [L47] var_1_2 = __VERIFIER_nondet_uchar() [L48] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L48] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_1=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L49] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L49] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_3=256, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L50] var_1_3 = __VERIFIER_nondet_ushort() [L51] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L51] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L52] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L52] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=500, var_1_5=16, var_1_6=1, var_1_7=1] [L53] var_1_4 = __VERIFIER_nondet_long() [L54] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L54] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L55] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L55] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=16, var_1_6=1, var_1_7=1] [L56] var_1_5 = __VERIFIER_nondet_char() [L57] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L57] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L58] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L58] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L59] var_1_6 = __VERIFIER_nondet_uchar() [L60] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_7=1] [L60] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_7=1] [L61] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L61] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L62] var_1_7 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1] [L63] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1] [L64] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L64] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_1=1, var_1_2=1, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L77] RET updateVariables() [L78] CALL step() [L32] signed long int stepLocal_1 = ~ var_1_3; [L33] unsigned char stepLocal_0 = var_1_7; VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L34] COND TRUE \read(var_1_2) VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L35] EXPR var_1_4 >> var_1_5 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=1, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L35] COND FALSE !(stepLocal_1 != (var_1_4 >> var_1_5)) [L42] var_1_1 = var_1_5 VAL [isInitial=1, stepLocal_0=1, stepLocal_1=-1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L78] RET step() [L79] CALL, EXPR property() [L69] EXPR var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L69] EXPR var_1_4 >> var_1_5 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L69] EXPR var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 VAL [isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L69-L70] return var_1_2 ? (((~ var_1_3) != (var_1_4 >> var_1_5)) ? ((var_1_6 || var_1_7) ? (var_1_1 == ((unsigned char) (64 + var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) : 1 ; [L79] RET, EXPR property() [L79] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_1=32, var_1_2=1, var_1_3=0, var_1_4=1, var_1_5=32, var_1_6=1, var_1_7=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 793 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 467 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 224 IncrementalHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 326 mSDtfsCounter, 224 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=5, InterpolantAutomatonStates: 27, 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, 6 MinimizatonAttempts, 29 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 536 NumberOfCodeBlocks, 536 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 452 ConstructedInterpolants, 0 QuantifiedInterpolants, 696 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1584/1584 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-15 21:06:06,610 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...