/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-81.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 13:29:58,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 13:29:58,679 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:58,682 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 13:29:58,683 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 13:29:58,705 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 13:29:58,705 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 13:29:58,705 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 13:29:58,706 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 13:29:58,709 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 13:29:58,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 13:29:58,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 13:29:58,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 13:29:58,711 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 13:29:58,711 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 13:29:58,711 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 13:29:58,711 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 13:29:58,711 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 13:29:58,712 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 13:29:58,712 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 13:29:58,712 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 13:29:58,713 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 13:29:58,713 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 13:29:58,713 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 13:29:58,714 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 13:29:58,714 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 13:29:58,714 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 13:29:58,714 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 13:29:58,715 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 13:29:58,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 13:29:58,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 13:29:58,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 13:29:58,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:29:58,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 13:29:58,716 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 13:29:58,716 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 13:29:58,716 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 13:29:58,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 13:29:58,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 13:29:58,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 13:29:58,717 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 13:29:58,718 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 13:29:58,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 13:29:58,718 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:58,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 13:29:59,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 13:29:59,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 13:29:59,014 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 13:29:59,015 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 13:29:59,017 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-81.i [2023-12-19 13:29:59,992 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 13:30:00,144 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 13:30:00,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount25_file-81.i [2023-12-19 13:30:00,152 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a16a436/4dcbe2f2d0f540019f35dfc86532e8fe/FLAG7d9dc37b3 [2023-12-19 13:30:00,165 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1a16a436/4dcbe2f2d0f540019f35dfc86532e8fe [2023-12-19 13:30:00,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 13:30:00,168 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 13:30:00,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 13:30:00,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 13:30:00,175 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 13:30:00,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbebe5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00, skipping insertion in model container [2023-12-19 13:30:00,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,204 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 13:30:00,339 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-81.i[915,928] [2023-12-19 13:30:00,389 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:30:00,403 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 13:30:00,412 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-81.i[915,928] [2023-12-19 13:30:00,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 13:30:00,449 INFO L206 MainTranslator]: Completed translation [2023-12-19 13:30:00,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00 WrapperNode [2023-12-19 13:30:00,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 13:30:00,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 13:30:00,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 13:30:00,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 13:30:00,456 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:30:00" (1/1) ... [2023-12-19 13:30:00,478 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:30:00" (1/1) ... [2023-12-19 13:30:00,512 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-12-19 13:30:00,512 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 13:30:00,513 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 13:30:00,513 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 13:30:00,513 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 13:30:00,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,532 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,542 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:30:00,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,546 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,549 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,550 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,551 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 13:30:00,552 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 13:30:00,552 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 13:30:00,552 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 13:30:00,553 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (1/1) ... [2023-12-19 13:30:00,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 13:30:00,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:30:00,616 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:30:00,649 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:30:00,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 13:30:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 13:30:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 13:30:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 13:30:00,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 13:30:00,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 13:30:00,733 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 13:30:00,734 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 13:30:00,934 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 13:30:00,958 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 13:30:00,958 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 13:30:00,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:30:00 BoogieIcfgContainer [2023-12-19 13:30:00,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 13:30:00,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 13:30:00,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 13:30:00,962 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 13:30:00,962 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 01:30:00" (1/3) ... [2023-12-19 13:30:00,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a671811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:30:00, skipping insertion in model container [2023-12-19 13:30:00,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 01:30:00" (2/3) ... [2023-12-19 13:30:00,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a671811 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 01:30:00, skipping insertion in model container [2023-12-19 13:30:00,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 01:30:00" (3/3) ... [2023-12-19 13:30:00,964 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-81.i [2023-12-19 13:30:00,975 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 13:30:00,975 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 13:30:01,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 13:30:01,008 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;@78b68597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 13:30:01,008 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 13:30:01,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 13:30:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 13:30:01,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:01,019 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:01,020 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:01,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:01,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1587523410, now seen corresponding path program 1 times [2023-12-19 13:30:01,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:01,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425361672] [2023-12-19 13:30:01,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:01,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:01,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:01,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:01,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:01,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425361672] [2023-12-19 13:30:01,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425361672] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:01,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:01,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 13:30:01,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774999922] [2023-12-19 13:30:01,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:01,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 13:30:01,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:01,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 13:30:01,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 13:30:01,396 INFO L87 Difference]: Start difference. First operand has 57 states, 38 states have (on average 1.5) internal successors, (57), 39 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 13:30:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:01,439 INFO L93 Difference]: Finished difference Result 111 states and 192 transitions. [2023-12-19 13:30:01,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 13:30:01,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 104 [2023-12-19 13:30:01,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:01,447 INFO L225 Difference]: With dead ends: 111 [2023-12-19 13:30:01,447 INFO L226 Difference]: Without dead ends: 55 [2023-12-19 13:30:01,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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:30:01,452 INFO L413 NwaCegarLoop]: 79 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, 79 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:30:01,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:30:01,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-19 13:30:01,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-19 13:30:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 37 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-19 13:30:01,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 82 transitions. [2023-12-19 13:30:01,489 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 82 transitions. Word has length 104 [2023-12-19 13:30:01,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:01,489 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 82 transitions. [2023-12-19 13:30:01,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-19 13:30:01,490 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 82 transitions. [2023-12-19 13:30:01,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 13:30:01,492 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:01,492 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:01,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 13:30:01,492 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:01,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:01,493 INFO L85 PathProgramCache]: Analyzing trace with hash -795711398, now seen corresponding path program 1 times [2023-12-19 13:30:01,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108118329] [2023-12-19 13:30:01,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:01,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:01,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:02,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:02,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:02,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,133 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:02,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:02,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108118329] [2023-12-19 13:30:02,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108118329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:02,134 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:02,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 13:30:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214756528] [2023-12-19 13:30:02,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:02,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 13:30:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:02,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 13:30:02,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:30:02,148 INFO L87 Difference]: Start difference. First operand 55 states and 82 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:02,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:02,421 INFO L93 Difference]: Finished difference Result 154 states and 228 transitions. [2023-12-19 13:30:02,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 13:30:02,421 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-19 13:30:02,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:02,423 INFO L225 Difference]: With dead ends: 154 [2023-12-19 13:30:02,423 INFO L226 Difference]: Without dead ends: 100 [2023-12-19 13:30:02,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 13:30:02,425 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 63 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:02,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 308 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:30:02,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-19 13:30:02,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2023-12-19 13:30:02,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.3676470588235294) internal successors, (93), 69 states have internal predecessors, (93), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 13:30:02,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 141 transitions. [2023-12-19 13:30:02,446 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 141 transitions. Word has length 104 [2023-12-19 13:30:02,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:02,447 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 141 transitions. [2023-12-19 13:30:02,447 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, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:02,447 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 141 transitions. [2023-12-19 13:30:02,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 13:30:02,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:02,449 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:02,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 13:30:02,449 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:02,450 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:02,450 INFO L85 PathProgramCache]: Analyzing trace with hash -537545960, now seen corresponding path program 1 times [2023-12-19 13:30:02,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:02,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459265403] [2023-12-19 13:30:02,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:02,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:02,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:02,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,620 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:02,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:02,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459265403] [2023-12-19 13:30:02,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459265403] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:02,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:02,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 13:30:02,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257253340] [2023-12-19 13:30:02,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:02,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:30:02,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:02,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:30:02,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:30:02,628 INFO L87 Difference]: Start difference. First operand 95 states and 141 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:02,684 INFO L93 Difference]: Finished difference Result 195 states and 290 transitions. [2023-12-19 13:30:02,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 13:30:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-19 13:30:02,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:02,693 INFO L225 Difference]: With dead ends: 195 [2023-12-19 13:30:02,693 INFO L226 Difference]: Without dead ends: 101 [2023-12-19 13:30:02,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:30:02,699 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:02,700 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 196 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:30:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-19 13:30:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2023-12-19 13:30:02,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 13:30:02,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 143 transitions. [2023-12-19 13:30:02,719 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 143 transitions. Word has length 104 [2023-12-19 13:30:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:02,720 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 143 transitions. [2023-12-19 13:30:02,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 143 transitions. [2023-12-19 13:30:02,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 13:30:02,728 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:02,728 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:02,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 13:30:02,729 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:02,729 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:02,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1924971498, now seen corresponding path program 1 times [2023-12-19 13:30:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:02,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388086995] [2023-12-19 13:30:02,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:02,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:02,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:02,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:02,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:02,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:02,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:02,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:02,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:02,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:02,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388086995] [2023-12-19 13:30:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388086995] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:02,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:02,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 13:30:02,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745204149] [2023-12-19 13:30:02,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:02,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 13:30:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:02,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 13:30:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:30:02,934 INFO L87 Difference]: Start difference. First operand 97 states and 143 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:03,067 INFO L93 Difference]: Finished difference Result 261 states and 383 transitions. [2023-12-19 13:30:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 13:30:03,068 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-19 13:30:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:03,070 INFO L225 Difference]: With dead ends: 261 [2023-12-19 13:30:03,070 INFO L226 Difference]: Without dead ends: 165 [2023-12-19 13:30:03,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 13:30:03,080 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 104 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:03,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 295 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:30:03,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-12-19 13:30:03,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2023-12-19 13:30:03,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 108 states have internal predecessors, (144), 40 states have call successors, (40), 3 states have call predecessors, (40), 3 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 13:30:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 224 transitions. [2023-12-19 13:30:03,098 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 224 transitions. Word has length 105 [2023-12-19 13:30:03,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:03,099 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 224 transitions. [2023-12-19 13:30:03,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:03,099 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 224 transitions. [2023-12-19 13:30:03,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 13:30:03,100 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:03,100 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:03,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 13:30:03,100 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:03,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:03,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1783189784, now seen corresponding path program 1 times [2023-12-19 13:30:03,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:03,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376809810] [2023-12-19 13:30:03,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:03,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:03,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:03,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:03,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:03,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 13:30:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:03,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376809810] [2023-12-19 13:30:03,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376809810] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 13:30:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431546495] [2023-12-19 13:30:03,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:03,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:30:03,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 13:30:03,502 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:30:03,543 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:30:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:03,595 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-19 13:30:03,601 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 13:30:03,686 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 145 proven. 6 refuted. 0 times theorem prover too weak. 329 trivial. 0 not checked. [2023-12-19 13:30:03,686 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 13:30:03,817 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 39 proven. 6 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-19 13:30:03,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431546495] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 13:30:03,817 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-19 13:30:03,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2023-12-19 13:30:03,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351185644] [2023-12-19 13:30:03,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-19 13:30:03,818 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 13:30:03,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:03,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 13:30:03,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 13:30:03,819 INFO L87 Difference]: Start difference. First operand 151 states and 224 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 13:30:04,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:04,110 INFO L93 Difference]: Finished difference Result 434 states and 628 transitions. [2023-12-19 13:30:04,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-19 13:30:04,111 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 105 [2023-12-19 13:30:04,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:04,112 INFO L225 Difference]: With dead ends: 434 [2023-12-19 13:30:04,112 INFO L226 Difference]: Without dead ends: 284 [2023-12-19 13:30:04,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 237 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-19 13:30:04,113 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 218 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:04,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 184 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 13:30:04,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-12-19 13:30:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 264. [2023-12-19 13:30:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 191 states have (on average 1.3089005235602094) internal successors, (250), 193 states have internal predecessors, (250), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 13:30:04,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 378 transitions. [2023-12-19 13:30:04,150 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 378 transitions. Word has length 105 [2023-12-19 13:30:04,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:04,151 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 378 transitions. [2023-12-19 13:30:04,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (18), 2 states have call predecessors, (18), 4 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-12-19 13:30:04,151 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 378 transitions. [2023-12-19 13:30:04,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-19 13:30:04,152 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:04,152 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:04,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 13:30:04,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 13:30:04,358 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:04,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1447421076, now seen corresponding path program 1 times [2023-12-19 13:30:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026040040] [2023-12-19 13:30:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:04,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:04,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:04,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:04,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:04,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026040040] [2023-12-19 13:30:04,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026040040] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:04,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:04,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 13:30:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895415023] [2023-12-19 13:30:04,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:04,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:30:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:30:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:30:04,432 INFO L87 Difference]: Start difference. First operand 264 states and 378 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:04,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:04,480 INFO L93 Difference]: Finished difference Result 534 states and 763 transitions. [2023-12-19 13:30:04,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 13:30:04,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-19 13:30:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:04,482 INFO L225 Difference]: With dead ends: 534 [2023-12-19 13:30:04,482 INFO L226 Difference]: Without dead ends: 271 [2023-12-19 13:30:04,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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:30:04,483 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 81 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:04,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 216 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:30:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-12-19 13:30:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 264. [2023-12-19 13:30:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 191 states have (on average 1.293193717277487) internal successors, (247), 193 states have internal predecessors, (247), 64 states have call successors, (64), 8 states have call predecessors, (64), 8 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-19 13:30:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 375 transitions. [2023-12-19 13:30:04,506 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 375 transitions. Word has length 105 [2023-12-19 13:30:04,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:04,507 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 375 transitions. [2023-12-19 13:30:04,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 375 transitions. [2023-12-19 13:30:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 13:30:04,507 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:04,508 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:04,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 13:30:04,508 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:04,508 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1218564135, now seen corresponding path program 1 times [2023-12-19 13:30:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266845558] [2023-12-19 13:30:04,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:04,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:06,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:06,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:06,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:06,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:06,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:06,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:06,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:06,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:06,190 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:06,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:06,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266845558] [2023-12-19 13:30:06,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266845558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:06,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:06,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 13:30:06,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810142206] [2023-12-19 13:30:06,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:06,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 13:30:06,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:06,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 13:30:06,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2023-12-19 13:30:06,191 INFO L87 Difference]: Start difference. First operand 264 states and 375 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:07,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:07,215 INFO L93 Difference]: Finished difference Result 645 states and 897 transitions. [2023-12-19 13:30:07,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-19 13:30:07,216 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 13:30:07,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:07,218 INFO L225 Difference]: With dead ends: 645 [2023-12-19 13:30:07,218 INFO L226 Difference]: Without dead ends: 382 [2023-12-19 13:30:07,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=305, Invalid=817, Unknown=0, NotChecked=0, Total=1122 [2023-12-19 13:30:07,219 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 260 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:07,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 466 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 13:30:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2023-12-19 13:30:07,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 306. [2023-12-19 13:30:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 226 states have (on average 1.2787610619469028) internal successors, (289), 229 states have internal predecessors, (289), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2023-12-19 13:30:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 429 transitions. [2023-12-19 13:30:07,255 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 429 transitions. Word has length 107 [2023-12-19 13:30:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:07,255 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 429 transitions. [2023-12-19 13:30:07,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 429 transitions. [2023-12-19 13:30:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 13:30:07,256 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:07,256 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 13:30:07,257 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:07,257 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:07,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1956076049, now seen corresponding path program 1 times [2023-12-19 13:30:07,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:07,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862097291] [2023-12-19 13:30:07,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:07,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:07,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:07,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:07,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:07,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:07,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:07,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862097291] [2023-12-19 13:30:07,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862097291] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:07,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:07,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 13:30:07,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012478144] [2023-12-19 13:30:07,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:07,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 13:30:07,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:07,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 13:30:07,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:30:07,388 INFO L87 Difference]: Start difference. First operand 306 states and 429 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:07,498 INFO L93 Difference]: Finished difference Result 828 states and 1160 transitions. [2023-12-19 13:30:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 13:30:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 107 [2023-12-19 13:30:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:07,502 INFO L225 Difference]: With dead ends: 828 [2023-12-19 13:30:07,502 INFO L226 Difference]: Without dead ends: 534 [2023-12-19 13:30:07,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 13:30:07,503 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 82 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:07,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 239 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 13:30:07,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2023-12-19 13:30:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 402. [2023-12-19 13:30:07,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 303 states have (on average 1.2409240924092408) internal successors, (376), 307 states have internal predecessors, (376), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 13:30:07,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 548 transitions. [2023-12-19 13:30:07,561 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 548 transitions. Word has length 107 [2023-12-19 13:30:07,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:07,562 INFO L495 AbstractCegarLoop]: Abstraction has 402 states and 548 transitions. [2023-12-19 13:30:07,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:07,562 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 548 transitions. [2023-12-19 13:30:07,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 13:30:07,563 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:07,563 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 13:30:07,563 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:07,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:07,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1558902308, now seen corresponding path program 1 times [2023-12-19 13:30:07,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:07,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586062542] [2023-12-19 13:30:07,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:07,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:07,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:07,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:07,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:07,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:07,645 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:07,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:07,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586062542] [2023-12-19 13:30:07,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586062542] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:07,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 13:30:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907156900] [2023-12-19 13:30:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:07,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 13:30:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 13:30:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 13:30:07,646 INFO L87 Difference]: Start difference. First operand 402 states and 548 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:07,757 INFO L93 Difference]: Finished difference Result 975 states and 1329 transitions. [2023-12-19 13:30:07,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 13:30:07,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 13:30:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:07,760 INFO L225 Difference]: With dead ends: 975 [2023-12-19 13:30:07,760 INFO L226 Difference]: Without dead ends: 585 [2023-12-19 13:30:07,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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:30:07,761 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 63 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:07,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 183 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 13:30:07,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-19 13:30:07,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 370. [2023-12-19 13:30:07,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 271 states have (on average 1.169741697416974) internal successors, (317), 275 states have internal predecessors, (317), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 13:30:07,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 489 transitions. [2023-12-19 13:30:07,798 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 489 transitions. Word has length 108 [2023-12-19 13:30:07,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:07,798 INFO L495 AbstractCegarLoop]: Abstraction has 370 states and 489 transitions. [2023-12-19 13:30:07,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:07,798 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 489 transitions. [2023-12-19 13:30:07,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 13:30:07,799 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:07,799 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:07,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 13:30:07,799 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:07,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:07,799 INFO L85 PathProgramCache]: Analyzing trace with hash -971649408, now seen corresponding path program 1 times [2023-12-19 13:30:07,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:07,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645086013] [2023-12-19 13:30:07,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:07,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:07,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 13:30:10,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 13:30:10,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 13:30:10,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-19 13:30:10,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-19 13:30:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-12-19 13:30:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-12-19 13:30:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 13:30:10,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 13:30:10,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 13:30:10,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 13:30:10,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 13:30:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 13:30:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 13:30:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 13:30:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 13:30:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 13:30:10,374 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-19 13:30:10,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 13:30:10,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645086013] [2023-12-19 13:30:10,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645086013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 13:30:10,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 13:30:10,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 13:30:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625628024] [2023-12-19 13:30:10,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 13:30:10,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 13:30:10,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 13:30:10,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 13:30:10,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2023-12-19 13:30:10,376 INFO L87 Difference]: Start difference. First operand 370 states and 489 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:11,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 13:30:11,397 INFO L93 Difference]: Finished difference Result 417 states and 537 transitions. [2023-12-19 13:30:11,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-19 13:30:11,403 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-19 13:30:11,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 13:30:11,405 INFO L225 Difference]: With dead ends: 417 [2023-12-19 13:30:11,405 INFO L226 Difference]: Without dead ends: 415 [2023-12-19 13:30:11,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=247, Invalid=623, Unknown=0, NotChecked=0, Total=870 [2023-12-19 13:30:11,406 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 221 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 13:30:11,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 417 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 13:30:11,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-12-19 13:30:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 375. [2023-12-19 13:30:11,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 276 states have (on average 1.1666666666666667) internal successors, (322), 280 states have internal predecessors, (322), 86 states have call successors, (86), 12 states have call predecessors, (86), 12 states have return successors, (86), 82 states have call predecessors, (86), 86 states have call successors, (86) [2023-12-19 13:30:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 494 transitions. [2023-12-19 13:30:11,454 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 494 transitions. Word has length 108 [2023-12-19 13:30:11,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 13:30:11,455 INFO L495 AbstractCegarLoop]: Abstraction has 375 states and 494 transitions. [2023-12-19 13:30:11,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 14 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-19 13:30:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 494 transitions. [2023-12-19 13:30:11,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-19 13:30:11,456 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 13:30:11,456 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30:11,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 13:30:11,456 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 13:30:11,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 13:30:11,456 INFO L85 PathProgramCache]: Analyzing trace with hash 185914068, now seen corresponding path program 1 times [2023-12-19 13:30:11,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 13:30:11,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712855713] [2023-12-19 13:30:11,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 13:30:11,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 13:30:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 13:30:11,502 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 13:30:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 13:30:11,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 13:30:11,547 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 13:30:11,548 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 13:30:11,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 13:30:11,551 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 13:30:11,552 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 13:30:11,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 01:30:11 BoogieIcfgContainer [2023-12-19 13:30:11,591 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 13:30:11,591 INFO L158 Benchmark]: Toolchain (without parser) took 11423.57ms. Allocated memory was 198.2MB in the beginning and 557.8MB in the end (delta: 359.7MB). Free memory was 151.2MB in the beginning and 407.8MB in the end (delta: -256.7MB). Peak memory consumption was 104.0MB. Max. memory is 8.0GB. [2023-12-19 13:30:11,591 INFO L158 Benchmark]: CDTParser took 0.60ms. Allocated memory is still 198.2MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 13:30:11,592 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.35ms. Allocated memory is still 198.2MB. Free memory was 150.6MB in the beginning and 137.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-19 13:30:11,592 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.21ms. Allocated memory is still 198.2MB. Free memory was 137.9MB in the beginning and 135.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 13:30:11,592 INFO L158 Benchmark]: Boogie Preprocessor took 38.99ms. Allocated memory is still 198.2MB. Free memory was 135.5MB in the beginning and 133.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 13:30:11,592 INFO L158 Benchmark]: RCFGBuilder took 406.12ms. Allocated memory is still 198.2MB. Free memory was 132.8MB in the beginning and 115.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-19 13:30:11,592 INFO L158 Benchmark]: TraceAbstraction took 10631.28ms. Allocated memory was 198.2MB in the beginning and 557.8MB in the end (delta: 359.7MB). Free memory was 114.5MB in the beginning and 407.8MB in the end (delta: -293.3MB). Peak memory consumption was 67.3MB. Max. memory is 8.0GB. [2023-12-19 13:30:11,593 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.60ms. Allocated memory is still 198.2MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 281.35ms. Allocated memory is still 198.2MB. Free memory was 150.6MB in the beginning and 137.9MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 61.21ms. Allocated memory is still 198.2MB. Free memory was 137.9MB in the beginning and 135.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 38.99ms. Allocated memory is still 198.2MB. Free memory was 135.5MB in the beginning and 133.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 406.12ms. Allocated memory is still 198.2MB. Free memory was 132.8MB in the beginning and 115.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 10631.28ms. Allocated memory was 198.2MB in the beginning and 557.8MB in the end (delta: 359.7MB). Free memory was 114.5MB in the beginning and 407.8MB in the end (delta: -293.3MB). Peak memory consumption was 67.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 103, overapproximation of someBinaryArithmeticDOUBLEoperation at line 60. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.5; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 4.5; [L25] double var_1_4 = 2.5; [L26] double var_1_5 = 0.0; [L27] double var_1_6 = 999999999999.3; [L28] signed char var_1_7 = -128; [L29] signed char var_1_11 = -64; [L30] signed char var_1_12 = 5; [L31] signed char var_1_13 = 50; [L32] unsigned char var_1_14 = 0; [L33] unsigned char var_1_15 = 0; [L34] unsigned char var_1_16 = 0; [L35] unsigned char var_1_17 = 0; [L36] signed char last_1_var_1_7 = -128; [L107] isInitial = 1 [L108] FCALL initially() [L109] COND TRUE 1 [L110] CALL updateLastVariables() [L100] last_1_var_1_7 = var_1_7 [L110] RET updateLastVariables() [L111] CALL updateVariables() [L72] var_1_2 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L73] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L74] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_3=9/2, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L75] var_1_3 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L76] RET assume_abort_if_not((var_1_3 >= -922337.2036854765600e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_4=5/2, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L77] var_1_4 = __VERIFIER_nondet_double() [L78] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L78] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_5=0, var_1_6=9999999999993/10, var_1_7=-128] [L79] var_1_5 = __VERIFIER_nondet_double() [L80] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L80] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_6=9999999999993/10, var_1_7=-128] [L81] var_1_6 = __VERIFIER_nondet_double() [L82] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L82] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=-64, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L83] var_1_11 = __VERIFIER_nondet_char() [L84] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L84] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L85] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=50, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L86] var_1_13 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_13 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L87] RET assume_abort_if_not(var_1_13 >= -1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L88] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L89] var_1_15 = __VERIFIER_nondet_uchar() [L90] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L90] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L91] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L92] var_1_16 = __VERIFIER_nondet_uchar() [L93] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L93] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L94] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=0, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L95] var_1_17 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L96] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L97] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L111] RET updateVariables() [L112] CALL step() [L40] signed long int stepLocal_1 = ((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7; VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=25, var_1_12=5, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L41] COND FALSE !(last_1_var_1_7 <= stepLocal_1) [L44] var_1_12 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L46] unsigned char stepLocal_3 = var_1_2; [L47] unsigned long int stepLocal_2 = (((25u) > (var_1_12)) ? (25u) : (var_1_12)); VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L48] COND TRUE stepLocal_3 || var_1_15 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L49] COND TRUE stepLocal_2 <= var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L50] COND FALSE !(\read(var_1_2)) [L53] var_1_14 = var_1_17 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=19999/2, var_1_2=0, var_1_7=-128] [L59] COND TRUE \read(var_1_14) [L60] var_1_1 = ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))) VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-128] [L62] EXPR var_1_12 ^ var_1_12 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-128] [L62] signed long int stepLocal_0 = var_1_12 ^ var_1_12; [L63] COND TRUE ((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != stepLocal_0 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=-128] [L64] COND TRUE \read(var_1_14) [L65] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_7=-128, stepLocal_0=0, stepLocal_1=-256, stepLocal_2=25, stepLocal_3=0, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=25] [L112] RET step() [L113] CALL, EXPR property() [L103] EXPR (var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11))) VAL [isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=25] [L103-L104] return (((var_1_14 ? (var_1_1 == ((double) ((((var_1_3) > ((var_1_4 - (var_1_5 - var_1_6)))) ? (var_1_3) : ((var_1_4 - (var_1_5 - var_1_6))))))) : 1) && ((((((-25) < (var_1_12)) ? (-25) : (var_1_12))) != (var_1_12 ^ var_1_12)) ? (var_1_14 ? (var_1_7 == ((signed char) var_1_11)) : 1) : (var_1_7 == ((signed char) var_1_11)))) && ((last_1_var_1_7 <= (((((last_1_var_1_7) < (last_1_var_1_7)) ? (last_1_var_1_7) : (last_1_var_1_7))) + last_1_var_1_7)) ? (var_1_12 == ((signed char) (var_1_13 - 1))) : (var_1_12 == ((signed char) var_1_11)))) && ((var_1_2 || var_1_15) ? ((((((25u) > (var_1_12)) ? (25u) : (var_1_12))) <= var_1_12) ? (var_1_2 ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_17))) : 1) : (var_1_14 == ((unsigned char) var_1_16))) ; [L113] RET, EXPR property() [L113] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=25] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_7=-128, var_1_11=25, var_1_12=25, var_1_13=126, var_1_14=1, var_1_15=1, var_1_16=0, var_1_17=1, var_1_1=1000000000004, var_1_2=0, var_1_3=1000000000004, var_1_7=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1123 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1095 mSDsluCounter, 2583 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1738 mSDsCounter, 331 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1457 IncrementalHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 331 mSolverCounterUnsat, 845 mSDtfsCounter, 1457 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 672 GetRequests, 572 SyntacticMatches, 2 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 429 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=402occurred in iteration=8, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 513 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 1271 NumberOfCodeBlocks, 1271 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1255 ConstructedInterpolants, 0 QuantifiedInterpolants, 5189 SizeOfPredicates, 4 NumberOfNonLiveVariables, 253 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 5742/5760 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:30:11,616 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...