/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_amount25_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 13:29:14,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 13:29:14,277 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-19 13:29:14,281 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 13:29:14,282 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 13:29:14,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 13:29:14,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 13:29:14,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 13:29:14,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 13:29:14,306 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 13:29:14,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 13:29:14,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 13:29:14,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 13:29:14,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 13:29:14,309 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 13:29:14,309 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 13:29:14,309 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 13:29:14,309 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 13:29:14,309 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 13:29:14,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 13:29:14,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 13:29:14,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 13:29:14,311 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 13:29:14,311 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 13:29:14,311 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 13:29:14,311 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 13:29:14,311 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 13:29:14,311 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 13:29:14,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 13:29:14,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:29:14,313 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 13:29:14,313 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 13:29:14,314 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 13:29:14,314 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 13:29:14,314 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 13:29:14,314 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 13:29:14,314 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 13:29:14,314 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-19 13:29:14,468 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 13:29:14,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 13:29:14,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 13:29:14,493 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 13:29:14,493 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 13:29:14,494 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-70.i [2023-12-19 13:29:15,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 13:29:15,571 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 13:29:15,572 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-70.i [2023-12-19 13:29:15,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708c0e55c/984088b199ad4527b7362b59a638fac7/FLAG8ff9f59d0 [2023-12-19 13:29:15,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/708c0e55c/984088b199ad4527b7362b59a638fac7 [2023-12-19 13:29:15,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 13:29:15,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 13:29:15,592 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 13:29:15,592 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 13:29:15,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 13:29:15,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550e989b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15, skipping insertion in model container [2023-12-19 13:29:15,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,611 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 13:29:15,695 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_amount25_file-70.i[915,928] [2023-12-19 13:29:15,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:29:15,726 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 13:29:15,734 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_amount25_file-70.i[915,928] [2023-12-19 13:29:15,748 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:29:15,757 INFO L206 MainTranslator]: Completed translation [2023-12-19 13:29:15,758 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15 WrapperNode [2023-12-19 13:29:15,758 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 13:29:15,759 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 13:29:15,759 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 13:29:15,759 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 13:29:15,763 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,769 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,787 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2023-12-19 13:29:15,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 13:29:15,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 13:29:15,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 13:29:15,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 13:29:15,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,797 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,807 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-19 13:29:15,807 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,815 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,816 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,819 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 13:29:15,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 13:29:15,819 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 13:29:15,819 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 13:29:15,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (1/1) ... [2023-12-19 13:29:15,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:29:15,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:29:15,840 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-19 13:29:15,864 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-19 13:29:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 13:29:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 13:29:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 13:29:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 13:29:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 13:29:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 13:29:15,956 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 13:29:15,961 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 13:29:16,216 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 13:29:16,244 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 13:29:16,244 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 13:29:16,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:29:16 BoogieIcfgContainer [2023-12-19 13:29:16,245 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 13:29:16,246 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 13:29:16,246 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 13:29:16,248 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 13:29:16,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:29:15" (1/3) ... [2023-12-19 13:29:16,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fe901f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:29:16, skipping insertion in model container [2023-12-19 13:29:16,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:29:15" (2/3) ... [2023-12-19 13:29:16,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14fe901f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:29:16, skipping insertion in model container [2023-12-19 13:29:16,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:29:16" (3/3) ... [2023-12-19 13:29:16,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-70.i [2023-12-19 13:29:16,262 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 13:29:16,262 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 13:29:16,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 13:29:16,298 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;@6c7eb55f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 13:29:16,321 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 13:29:16,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-19 13:29:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 13:29:16,334 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:16,335 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1] [2023-12-19 13:29:16,335 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:16,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:16,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1046689631, now seen corresponding path program 1 times [2023-12-19 13:29:16,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:16,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317369526] [2023-12-19 13:29:16,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:16,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:16,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:16,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:16,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:16,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:16,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:16,506 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:16,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:16,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317369526] [2023-12-19 13:29:16,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317369526] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:16,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:16,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 13:29:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420623690] [2023-12-19 13:29:16,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:16,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 13:29:16,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:16,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 13:29:16,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 13:29:16,531 INFO L87 Difference]: Start difference. First operand has 49 states, 33 states have (on average 1.4848484848484849) internal successors, (49), 34 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-19 13:29:16,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:16,573 INFO L93 Difference]: Finished difference Result 95 states and 161 transitions. [2023-12-19 13:29:16,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 13:29:16,575 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 86 [2023-12-19 13:29:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:16,579 INFO L225 Difference]: With dead ends: 95 [2023-12-19 13:29:16,580 INFO L226 Difference]: Without dead ends: 47 [2023-12-19 13:29:16,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 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-19 13:29:16,584 INFO L413 NwaCegarLoop]: 67 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, 67 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-19 13:29:16,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:29:16,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-19 13:29:16,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2023-12-19 13:29:16,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 32 states have (on average 1.375) internal successors, (44), 32 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-19 13:29:16,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 70 transitions. [2023-12-19 13:29:16,609 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 70 transitions. Word has length 86 [2023-12-19 13:29:16,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:16,609 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 70 transitions. [2023-12-19 13:29:16,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-19 13:29:16,609 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 70 transitions. [2023-12-19 13:29:16,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 13:29:16,611 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:16,612 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1] [2023-12-19 13:29:16,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 13:29:16,612 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:16,612 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:16,613 INFO L85 PathProgramCache]: Analyzing trace with hash 484166429, now seen corresponding path program 1 times [2023-12-19 13:29:16,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:16,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626444828] [2023-12-19 13:29:16,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:16,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:18,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:18,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:18,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:18,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:18,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:18,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:18,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:18,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:18,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626444828] [2023-12-19 13:29:18,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626444828] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:18,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:18,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 13:29:18,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192440620] [2023-12-19 13:29:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:18,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 13:29:18,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 13:29:18,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:29:18,149 INFO L87 Difference]: Start difference. First operand 47 states and 70 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-19 13:29:22,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:22,419 INFO L93 Difference]: Finished difference Result 116 states and 174 transitions. [2023-12-19 13:29:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 13:29:22,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-12-19 13:29:22,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:22,421 INFO L225 Difference]: With dead ends: 116 [2023-12-19 13:29:22,422 INFO L226 Difference]: Without dead ends: 70 [2023-12-19 13:29:22,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-19 13:29:22,423 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 55 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:22,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 133 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 101 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2023-12-19 13:29:22,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-12-19 13:29:22,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 57. [2023-12-19 13:29:22,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 42 states have internal predecessors, (60), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-19 13:29:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 86 transitions. [2023-12-19 13:29:22,442 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 86 transitions. Word has length 86 [2023-12-19 13:29:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:22,444 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 86 transitions. [2023-12-19 13:29:22,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,445 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 86 transitions. [2023-12-19 13:29:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 13:29:22,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:22,449 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1] [2023-12-19 13:29:22,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 13:29:22,450 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:22,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:22,450 INFO L85 PathProgramCache]: Analyzing trace with hash 742331867, now seen corresponding path program 1 times [2023-12-19 13:29:22,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:22,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847445889] [2023-12-19 13:29:22,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:22,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:22,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:22,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:22,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:22,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:22,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,533 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:22,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:22,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847445889] [2023-12-19 13:29:22,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847445889] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:22,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:22,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:29:22,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791508408] [2023-12-19 13:29:22,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:22,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 13:29:22,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 13:29:22,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:29:22,538 INFO L87 Difference]: Start difference. First operand 57 states and 86 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:22,563 INFO L93 Difference]: Finished difference Result 124 states and 185 transitions. [2023-12-19 13:29:22,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 13:29:22,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-12-19 13:29:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:22,565 INFO L225 Difference]: With dead ends: 124 [2023-12-19 13:29:22,565 INFO L226 Difference]: Without dead ends: 68 [2023-12-19 13:29:22,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-19 13:29:22,566 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 24 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 148 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-19 13:29:22,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 148 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:29:22,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-12-19 13:29:22,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2023-12-19 13:29:22,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-19 13:29:22,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 85 transitions. [2023-12-19 13:29:22,571 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 85 transitions. Word has length 86 [2023-12-19 13:29:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:22,572 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 85 transitions. [2023-12-19 13:29:22,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,572 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 85 transitions. [2023-12-19 13:29:22,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 13:29:22,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:22,573 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1] [2023-12-19 13:29:22,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 13:29:22,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:22,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:22,573 INFO L85 PathProgramCache]: Analyzing trace with hash 799590169, now seen corresponding path program 1 times [2023-12-19 13:29:22,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:22,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769405656] [2023-12-19 13:29:22,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:22,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:22,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:22,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:22,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:22,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:22,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769405656] [2023-12-19 13:29:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769405656] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:22,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:22,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:29:22,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381723345] [2023-12-19 13:29:22,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:22,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 13:29:22,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:22,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 13:29:22,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:29:22,711 INFO L87 Difference]: Start difference. First operand 57 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:22,757 INFO L93 Difference]: Finished difference Result 159 states and 237 transitions. [2023-12-19 13:29:22,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 13:29:22,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-12-19 13:29:22,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:22,762 INFO L225 Difference]: With dead ends: 159 [2023-12-19 13:29:22,762 INFO L226 Difference]: Without dead ends: 103 [2023-12-19 13:29:22,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-19 13:29:22,763 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:22,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 134 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:29:22,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-19 13:29:22,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2023-12-19 13:29:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 13:29:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 148 transitions. [2023-12-19 13:29:22,771 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 148 transitions. Word has length 86 [2023-12-19 13:29:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:22,771 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 148 transitions. [2023-12-19 13:29:22,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,772 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 148 transitions. [2023-12-19 13:29:22,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-19 13:29:22,774 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:22,774 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1] [2023-12-19 13:29:22,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 13:29:22,774 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:22,774 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:22,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1192617179, now seen corresponding path program 1 times [2023-12-19 13:29:22,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:22,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441628073] [2023-12-19 13:29:22,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:22,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:22,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:22,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:22,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:22,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:22,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:22,915 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:22,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:22,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441628073] [2023-12-19 13:29:22,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441628073] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:22,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:22,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 13:29:22,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440594429] [2023-12-19 13:29:22,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:22,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:29:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:22,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:29:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:29:22,919 INFO L87 Difference]: Start difference. First operand 101 states and 148 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:22,952 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2023-12-19 13:29:22,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 13:29:22,953 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 86 [2023-12-19 13:29:22,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:22,955 INFO L225 Difference]: With dead ends: 212 [2023-12-19 13:29:22,955 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 13:29:22,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:29:22,960 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 29 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:22,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 222 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:29:22,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 13:29:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 99. [2023-12-19 13:29:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 13:29:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 144 transitions. [2023-12-19 13:29:22,979 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 144 transitions. Word has length 86 [2023-12-19 13:29:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:22,979 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 144 transitions. [2023-12-19 13:29:22,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 144 transitions. [2023-12-19 13:29:22,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:29:22,980 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:22,980 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:29:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 13:29:22,981 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:22,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:22,981 INFO L85 PathProgramCache]: Analyzing trace with hash 971323963, now seen corresponding path program 1 times [2023-12-19 13:29:22,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:22,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457236136] [2023-12-19 13:29:22,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:22,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:23,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:23,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:23,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:23,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457236136] [2023-12-19 13:29:23,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457236136] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:23,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:23,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 13:29:23,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179945061] [2023-12-19 13:29:23,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:23,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 13:29:23,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:23,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 13:29:23,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 13:29:23,045 INFO L87 Difference]: Start difference. First operand 99 states and 144 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:23,088 INFO L93 Difference]: Finished difference Result 191 states and 280 transitions. [2023-12-19 13:29:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 13:29:23,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-12-19 13:29:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:23,090 INFO L225 Difference]: With dead ends: 191 [2023-12-19 13:29:23,090 INFO L226 Difference]: Without dead ends: 137 [2023-12-19 13:29:23,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-19 13:29:23,094 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:23,094 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 128 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:29:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-12-19 13:29:23,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2023-12-19 13:29:23,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 98 states have (on average 1.316326530612245) internal successors, (129), 99 states have internal predecessors, (129), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-19 13:29:23,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 193 transitions. [2023-12-19 13:29:23,116 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 193 transitions. Word has length 89 [2023-12-19 13:29:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:23,117 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 193 transitions. [2023-12-19 13:29:23,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 193 transitions. [2023-12-19 13:29:23,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:29:23,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:23,118 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:29:23,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 13:29:23,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:23,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:23,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1028582265, now seen corresponding path program 1 times [2023-12-19 13:29:23,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:23,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454698213] [2023-12-19 13:29:23,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:23,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:23,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:23,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:23,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:23,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,381 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-19 13:29:23,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:23,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454698213] [2023-12-19 13:29:23,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454698213] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 13:29:23,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1272139281] [2023-12-19 13:29:23,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:23,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:29:23,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:29:23,384 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 13:29:23,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 13:29:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:23,452 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-19 13:29:23,457 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:29:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 148 proven. 24 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2023-12-19 13:29:23,614 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:29:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-19 13:29:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1272139281] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 13:29:23,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 13:29:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2023-12-19 13:29:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774147892] [2023-12-19 13:29:23,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 13:29:23,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-19 13:29:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-19 13:29:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2023-12-19 13:29:23,817 INFO L87 Difference]: Start difference. First operand 134 states and 193 transitions. Second operand has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-19 13:29:24,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:24,204 INFO L93 Difference]: Finished difference Result 362 states and 499 transitions. [2023-12-19 13:29:24,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 13:29:24,204 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) Word has length 89 [2023-12-19 13:29:24,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:24,206 INFO L225 Difference]: With dead ends: 362 [2023-12-19 13:29:24,206 INFO L226 Difference]: Without dead ends: 229 [2023-12-19 13:29:24,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2023-12-19 13:29:24,207 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 263 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:24,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 216 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:29:24,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-19 13:29:24,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 212. [2023-12-19 13:29:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 164 states have (on average 1.2804878048780488) internal successors, (210), 168 states have internal predecessors, (210), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 13:29:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 286 transitions. [2023-12-19 13:29:24,218 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 286 transitions. Word has length 89 [2023-12-19 13:29:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:24,218 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 286 transitions. [2023-12-19 13:29:24,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 18 states have internal predecessors, (56), 4 states have call successors, (29), 2 states have call predecessors, (29), 4 states have return successors, (30), 4 states have call predecessors, (30), 4 states have call successors, (30) [2023-12-19 13:29:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 286 transitions. [2023-12-19 13:29:24,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:29:24,219 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:24,219 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:29:24,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 13:29:24,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:29:24,427 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:24,428 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:24,429 INFO L85 PathProgramCache]: Analyzing trace with hash 635555255, now seen corresponding path program 1 times [2023-12-19 13:29:24,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:24,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309352917] [2023-12-19 13:29:24,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:24,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:24,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:24,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:24,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:24,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309352917] [2023-12-19 13:29:24,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309352917] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:24,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:24,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 13:29:24,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474361074] [2023-12-19 13:29:24,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:24,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 13:29:24,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:24,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 13:29:24,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-19 13:29:24,952 INFO L87 Difference]: Start difference. First operand 212 states and 286 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:25,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:25,333 INFO L93 Difference]: Finished difference Result 228 states and 303 transitions. [2023-12-19 13:29:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 13:29:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-12-19 13:29:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:25,334 INFO L225 Difference]: With dead ends: 228 [2023-12-19 13:29:25,334 INFO L226 Difference]: Without dead ends: 226 [2023-12-19 13:29:25,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-19 13:29:25,335 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 70 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:25,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 333 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:29:25,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-12-19 13:29:25,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 221. [2023-12-19 13:29:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 173 states have (on average 1.2658959537572254) internal successors, (219), 177 states have internal predecessors, (219), 38 states have call successors, (38), 9 states have call predecessors, (38), 9 states have return successors, (38), 34 states have call predecessors, (38), 38 states have call successors, (38) [2023-12-19 13:29:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 295 transitions. [2023-12-19 13:29:25,353 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 295 transitions. Word has length 89 [2023-12-19 13:29:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:25,353 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 295 transitions. [2023-12-19 13:29:25,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 295 transitions. [2023-12-19 13:29:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:29:25,354 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:25,354 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:29:25,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 13:29:25,354 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:25,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:25,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1729646843, now seen corresponding path program 1 times [2023-12-19 13:29:25,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:25,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220208952] [2023-12-19 13:29:25,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:25,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:25,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:29:25,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:29:25,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:29:25,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 13:29:25,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 13:29:25,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 13:29:25,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 13:29:25,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-19 13:29:25,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-19 13:29:25,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-19 13:29:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-19 13:29:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 13:29:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-19 13:29:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:29:25,446 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-19 13:29:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:29:25,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220208952] [2023-12-19 13:29:25,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220208952] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:29:25,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:29:25,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 13:29:25,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308414611] [2023-12-19 13:29:25,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:29:25,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 13:29:25,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:29:25,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 13:29:25,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:29:25,448 INFO L87 Difference]: Start difference. First operand 221 states and 295 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:25,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:29:25,609 INFO L93 Difference]: Finished difference Result 460 states and 608 transitions. [2023-12-19 13:29:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 13:29:25,610 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-12-19 13:29:25,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:29:25,611 INFO L225 Difference]: With dead ends: 460 [2023-12-19 13:29:25,611 INFO L226 Difference]: Without dead ends: 311 [2023-12-19 13:29:25,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 13:29:25,613 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:29:25,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 206 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:29:25,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-19 13:29:25,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 218. [2023-12-19 13:29:25,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 172 states have (on average 1.2790697674418605) internal successors, (220), 175 states have internal predecessors, (220), 36 states have call successors, (36), 9 states have call predecessors, (36), 9 states have return successors, (36), 33 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-19 13:29:25,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 292 transitions. [2023-12-19 13:29:25,632 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 292 transitions. Word has length 89 [2023-12-19 13:29:25,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:29:25,632 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 292 transitions. [2023-12-19 13:29:25,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-19 13:29:25,632 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 292 transitions. [2023-12-19 13:29:25,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-12-19 13:29:25,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:29:25,633 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:29:25,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 13:29:25,634 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:29:25,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:29:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1885262083, now seen corresponding path program 1 times [2023-12-19 13:29:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:29:25,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011762116] [2023-12-19 13:29:25,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:29:25,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:29:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 13:29:25,658 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 13:29:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 13:29:25,694 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 13:29:25,694 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 13:29:25,695 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 13:29:25,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 13:29:25,697 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:29:25,700 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 13:29:25,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:29:25 BoogieIcfgContainer [2023-12-19 13:29:25,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 13:29:25,743 INFO L158 Benchmark]: Toolchain (without parser) took 10153.63ms. Allocated memory was 297.8MB in the beginning and 375.4MB in the end (delta: 77.6MB). Free memory was 253.0MB in the beginning and 272.7MB in the end (delta: -19.7MB). Peak memory consumption was 59.2MB. Max. memory is 8.0GB. [2023-12-19 13:29:25,743 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 201.3MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 13:29:25,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.46ms. Allocated memory is still 297.8MB. Free memory was 252.8MB in the beginning and 240.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 13:29:25,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.90ms. Allocated memory is still 297.8MB. Free memory was 239.9MB in the beginning and 237.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 13:29:25,744 INFO L158 Benchmark]: Boogie Preprocessor took 30.73ms. Allocated memory is still 297.8MB. Free memory was 237.1MB in the beginning and 233.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 13:29:25,744 INFO L158 Benchmark]: RCFGBuilder took 425.56ms. Allocated memory is still 297.8MB. Free memory was 233.4MB in the beginning and 214.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-19 13:29:25,744 INFO L158 Benchmark]: TraceAbstraction took 9496.88ms. Allocated memory was 297.8MB in the beginning and 375.4MB in the end (delta: 77.6MB). Free memory was 213.2MB in the beginning and 272.7MB in the end (delta: -59.5MB). Peak memory consumption was 19.3MB. Max. memory is 8.0GB. [2023-12-19 13:29:25,745 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.11ms. Allocated memory is still 201.3MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.46ms. Allocated memory is still 297.8MB. Free memory was 252.8MB in the beginning and 240.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.90ms. Allocated memory is still 297.8MB. Free memory was 239.9MB in the beginning and 237.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.73ms. Allocated memory is still 297.8MB. Free memory was 237.1MB in the beginning and 233.4MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 425.56ms. Allocated memory is still 297.8MB. Free memory was 233.4MB in the beginning and 214.0MB in the end (delta: 19.3MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 9496.88ms. Allocated memory was 297.8MB in the beginning and 375.4MB in the end (delta: 77.6MB). Free memory was 213.2MB in the beginning and 272.7MB in the end (delta: -59.5MB). Peak memory consumption was 19.3MB. 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 someBinaryDOUBLEComparisonOperation at line 77, overapproximation of shiftLeft at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; [L81] isInitial = 1 [L82] FCALL initially() [L83] COND TRUE 1 [L84] FCALL updateLastVariables() [L85] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L85] RET updateVariables() [L86] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND FALSE !(stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) [L43] var_1_7 = (var_1_5 + (var_1_1 + var_1_4)) VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=83/10, var_1_9=255] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L48] COND FALSE !(var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) VAL [isInitial=1, stepLocal_0=29917, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L86] RET step() [L87] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L87] RET, EXPR property() [L87] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_11=76932, var_1_1=46884, var_1_2=1, var_1_3=128, var_1_4=29917, var_1_5=126, var_1_6=25, var_1_7=76927, var_1_8=76932, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.4s, OverallIterations: 10, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 590 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 586 mSDsluCounter, 1587 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 966 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 830 IncrementalHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 621 mSDtfsCounter, 830 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 491 GetRequests, 435 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=221occurred in iteration=8, InterpolantAutomatonStates: 53, 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, 9 MinimizatonAttempts, 157 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 953 ConstructedInterpolants, 0 QuantifiedInterpolants, 4716 SizeOfPredicates, 9 NumberOfNonLiveVariables, 213 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 11 InterpolantComputations, 8 PerfectInterpolantSequences, 3360/3432 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-19 13:29:25,763 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...