/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 22:58:57,716 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 22:58:57,779 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-20 22:58:57,783 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 22:58:57,783 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 22:58:57,803 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 22:58:57,804 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 22:58:57,804 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 22:58:57,804 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 22:58:57,807 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 22:58:57,807 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 22:58:57,808 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 22:58:57,808 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 22:58:57,809 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 22:58:57,809 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 22:58:57,809 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 22:58:57,809 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 22:58:57,809 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 22:58:57,810 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 22:58:57,810 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 22:58:57,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 22:58:57,812 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 22:58:57,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 22:58:57,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 22:58:57,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 22:58:57,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 22:58:57,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:58:57,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 22:58:57,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 22:58:57,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 22:58:57,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 22:58:57,814 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 22:58:58,010 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 22:58:58,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 22:58:58,031 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 22:58:58,032 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 22:58:58,032 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 22:58:58,033 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2023-12-20 22:58:58,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 22:58:59,113 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 22:58:59,113 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-70.i [2023-12-20 22:58:59,119 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489c702a2/10dbda36576e42da9d88d36efcd0eb87/FLAG3c7db05f3 [2023-12-20 22:58:59,129 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/489c702a2/10dbda36576e42da9d88d36efcd0eb87 [2023-12-20 22:58:59,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 22:58:59,131 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 22:58:59,132 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 22:58:59,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 22:58:59,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 22:58:59,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,138 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d3fe06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59, skipping insertion in model container [2023-12-20 22:58:59,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,163 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 22:58:59,281 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_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2023-12-20 22:58:59,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:58:59,328 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 22:58:59,336 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_loopvsstraightlinecode_25-1loop_file-70.i[915,928] [2023-12-20 22:58:59,356 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 22:58:59,370 INFO L206 MainTranslator]: Completed translation [2023-12-20 22:58:59,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59 WrapperNode [2023-12-20 22:58:59,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 22:58:59,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 22:58:59,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 22:58:59,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 22:58:59,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,401 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,422 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2023-12-20 22:58:59,423 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 22:58:59,423 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 22:58:59,423 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 22:58:59,424 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 22:58:59,436 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,438 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,447 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-20 22:58:59,447 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,447 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,452 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,454 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,456 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,458 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 22:58:59,459 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 22:58:59,459 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 22:58:59,459 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 22:58:59,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (1/1) ... [2023-12-20 22:58:59,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 22:58:59,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:58:59,497 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-20 22:58:59,521 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-20 22:58:59,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 22:58:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 22:58:59,527 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 22:58:59,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 22:58:59,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 22:58:59,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 22:58:59,608 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 22:58:59,611 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 22:58:59,812 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 22:58:59,845 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 22:58:59,845 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 22:58:59,845 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:58:59 BoogieIcfgContainer [2023-12-20 22:58:59,845 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 22:58:59,847 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 22:58:59,847 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 22:58:59,849 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 22:58:59,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 10:58:59" (1/3) ... [2023-12-20 22:58:59,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee65522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:58:59, skipping insertion in model container [2023-12-20 22:58:59,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 10:58:59" (2/3) ... [2023-12-20 22:58:59,850 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ee65522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 10:58:59, skipping insertion in model container [2023-12-20 22:58:59,850 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 10:58:59" (3/3) ... [2023-12-20 22:58:59,851 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-70.i [2023-12-20 22:58:59,864 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 22:58:59,864 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 22:58:59,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 22:58:59,906 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;@52eab7f5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 22:58:59,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 22:58:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-20 22:58:59,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 22:58:59,919 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:58:59,920 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:58:59,920 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:58:59,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:58:59,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1308845206, now seen corresponding path program 1 times [2023-12-20 22:58:59,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:58:59,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949465859] [2023-12-20 22:58:59,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:58:59,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:00,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:59:00,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:59:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:59:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:59:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:59:00,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:59:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:59:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:59:00,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:59:00,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:59:00,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:00,209 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-20 22:59:00,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:00,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949465859] [2023-12-20 22:59:00,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949465859] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:00,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:00,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 22:59:00,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581285237] [2023-12-20 22:59:00,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:00,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 22:59:00,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:00,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 22:59:00,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:59:00,243 INFO L87 Difference]: Start difference. First operand has 43 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-20 22:59:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:00,299 INFO L93 Difference]: Finished difference Result 85 states and 142 transitions. [2023-12-20 22:59:00,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 22:59:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2023-12-20 22:59:00,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:00,308 INFO L225 Difference]: With dead ends: 85 [2023-12-20 22:59:00,308 INFO L226 Difference]: Without dead ends: 41 [2023-12-20 22:59:00,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 22:59:00,314 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:00,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:59:00,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-20 22:59:00,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-20 22:59:00,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-20 22:59:00,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-20 22:59:00,353 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 85 [2023-12-20 22:59:00,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:00,353 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-20 22:59:00,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 2 states have call successors, (13) [2023-12-20 22:59:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-20 22:59:00,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 22:59:00,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:00,359 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:59:00,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 22:59:00,359 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:00,360 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:00,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1604085780, now seen corresponding path program 1 times [2023-12-20 22:59:00,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615951019] [2023-12-20 22:59:00,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:00,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:01,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:59:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:59:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:59:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:59:01,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:59:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:59:01,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:59:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:59:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:59:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:59:01,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-20 22:59:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:01,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615951019] [2023-12-20 22:59:01,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615951019] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:01,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:01,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 22:59:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413870938] [2023-12-20 22:59:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:01,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 22:59:01,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:01,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 22:59:01,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:59:01,682 INFO L87 Difference]: Start difference. First operand 41 states and 60 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-20 22:59:01,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:01,929 INFO L93 Difference]: Finished difference Result 98 states and 144 transitions. [2023-12-20 22:59:01,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 22:59:01,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2023-12-20 22:59:01,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:01,932 INFO L225 Difference]: With dead ends: 98 [2023-12-20 22:59:01,932 INFO L226 Difference]: Without dead ends: 58 [2023-12-20 22:59:01,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-20 22:59:01,933 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:01,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 155 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 22:59:01,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2023-12-20 22:59:01,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 48. [2023-12-20 22:59:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-20 22:59:01,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2023-12-20 22:59:01,939 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 85 [2023-12-20 22:59:01,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:01,940 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2023-12-20 22:59:01,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-20 22:59:01,941 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2023-12-20 22:59:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 22:59:01,941 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:01,942 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:59:01,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 22:59:01,942 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:01,942 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash -903021202, now seen corresponding path program 1 times [2023-12-20 22:59:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:01,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348202077] [2023-12-20 22:59:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:01,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:59:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:59:02,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:59:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:59:02,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:59:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:59:02,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:59:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:59:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:59:02,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:59:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-20 22:59:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:02,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348202077] [2023-12-20 22:59:02,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348202077] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:02,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:02,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 22:59:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660744659] [2023-12-20 22:59:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 22:59:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 22:59:02,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 22:59:02,079 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-20 22:59:02,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:02,123 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2023-12-20 22:59:02,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 22:59:02,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 85 [2023-12-20 22:59:02,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:02,125 INFO L225 Difference]: With dead ends: 103 [2023-12-20 22:59:02,125 INFO L226 Difference]: Without dead ends: 56 [2023-12-20 22:59:02,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 22:59:02,131 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 15 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:02,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 177 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 22:59:02,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-20 22:59:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2023-12-20 22:59:02,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-20 22:59:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-20 22:59:02,142 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 85 [2023-12-20 22:59:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:02,144 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-20 22:59:02,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-20 22:59:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-20 22:59:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-20 22:59:02,145 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:02,145 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:59:02,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 22:59:02,146 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:02,146 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:02,146 INFO L85 PathProgramCache]: Analyzing trace with hash 46148465, now seen corresponding path program 1 times [2023-12-20 22:59:02,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:02,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615206333] [2023-12-20 22:59:02,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:02,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:02,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:59:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:59:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:59:02,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:59:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:59:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:59:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:59:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:59:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:59:02,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:59:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,457 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2023-12-20 22:59:02,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615206333] [2023-12-20 22:59:02,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615206333] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-20 22:59:02,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758445255] [2023-12-20 22:59:02,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:02,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:59:02,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 22:59:02,463 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-20 22:59:02,491 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-20 22:59:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:02,529 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-20 22:59:02,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-20 22:59:02,887 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 202 proven. 36 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-12-20 22:59:02,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-20 22:59:03,219 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 30 proven. 39 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2023-12-20 22:59:03,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758445255] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-20 22:59:03,219 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-20 22:59:03,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 24 [2023-12-20 22:59:03,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189140111] [2023-12-20 22:59:03,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-20 22:59:03,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-20 22:59:03,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:03,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-20 22:59:03,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2023-12-20 22:59:03,222 INFO L87 Difference]: Start difference. First operand 46 states and 67 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-20 22:59:03,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:03,858 INFO L93 Difference]: Finished difference Result 160 states and 212 transitions. [2023-12-20 22:59:03,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-12-20 22:59:03,859 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) Word has length 87 [2023-12-20 22:59:03,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:03,859 INFO L225 Difference]: With dead ends: 160 [2023-12-20 22:59:03,860 INFO L226 Difference]: Without dead ends: 115 [2023-12-20 22:59:03,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 186 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=409, Invalid=1313, Unknown=0, NotChecked=0, Total=1722 [2023-12-20 22:59:03,861 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 346 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:03,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 150 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-20 22:59:03,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-20 22:59:03,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 76. [2023-12-20 22:59:03,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 56 states have (on average 1.2678571428571428) internal successors, (71), 57 states have internal predecessors, (71), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-20 22:59:03,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 101 transitions. [2023-12-20 22:59:03,869 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 101 transitions. Word has length 87 [2023-12-20 22:59:03,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:03,869 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 101 transitions. [2023-12-20 22:59:03,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 5 states have call successors, (26), 3 states have call predecessors, (26), 7 states have return successors, (28), 5 states have call predecessors, (28), 5 states have call successors, (28) [2023-12-20 22:59:03,869 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 101 transitions. [2023-12-20 22:59:03,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-20 22:59:03,870 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:03,870 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:59:03,876 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-20 22:59:04,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-20 22:59:04,076 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:04,077 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1535553461, now seen corresponding path program 1 times [2023-12-20 22:59:04,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:04,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80735402] [2023-12-20 22:59:04,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:04,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:04,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 22:59:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 22:59:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 22:59:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 22:59:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 22:59:04,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 22:59:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 22:59:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 22:59:04,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 22:59:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 22:59:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 22:59:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 22:59:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 22:59:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 22:59:04,505 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-20 22:59:04,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 22:59:04,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80735402] [2023-12-20 22:59:04,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80735402] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 22:59:04,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 22:59:04,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 22:59:04,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118563772] [2023-12-20 22:59:04,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 22:59:04,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 22:59:04,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 22:59:04,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 22:59:04,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-12-20 22:59:04,507 INFO L87 Difference]: Start difference. First operand 76 states and 101 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-20 22:59:04,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 22:59:04,764 INFO L93 Difference]: Finished difference Result 84 states and 108 transitions. [2023-12-20 22:59:04,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-20 22:59:04,765 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2023-12-20 22:59:04,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 22:59:04,766 INFO L225 Difference]: With dead ends: 84 [2023-12-20 22:59:04,766 INFO L226 Difference]: Without dead ends: 82 [2023-12-20 22:59:04,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-20 22:59:04,766 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 52 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 22:59:04,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 285 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 22:59:04,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-12-20 22:59:04,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-12-20 22:59:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 59 states have (on average 1.2542372881355932) internal successors, (74), 60 states have internal predecessors, (74), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2023-12-20 22:59:04,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 104 transitions. [2023-12-20 22:59:04,774 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 104 transitions. Word has length 87 [2023-12-20 22:59:04,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 22:59:04,775 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 104 transitions. [2023-12-20 22:59:04,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-12-20 22:59:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 104 transitions. [2023-12-20 22:59:04,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-20 22:59:04,775 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 22:59:04,776 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 22:59:04,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 22:59:04,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 22:59:04,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 22:59:04,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1537400503, now seen corresponding path program 1 times [2023-12-20 22:59:04,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 22:59:04,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491342657] [2023-12-20 22:59:04,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 22:59:04,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 22:59:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:59:04,799 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 22:59:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 22:59:04,837 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 22:59:04,837 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 22:59:04,837 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 22:59:04,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 22:59:04,842 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-20 22:59:04,845 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 22:59:04,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 10:59:04 BoogieIcfgContainer [2023-12-20 22:59:04,902 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 22:59:04,903 INFO L158 Benchmark]: Toolchain (without parser) took 5771.25ms. Allocated memory was 190.8MB in the beginning and 291.5MB in the end (delta: 100.7MB). Free memory was 148.8MB in the beginning and 158.8MB in the end (delta: -10.0MB). Peak memory consumption was 92.3MB. Max. memory is 8.0GB. [2023-12-20 22:59:04,904 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 142.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 22:59:04,904 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.67ms. Allocated memory is still 190.8MB. Free memory was 148.5MB in the beginning and 135.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 22:59:04,904 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.38ms. Allocated memory is still 190.8MB. Free memory was 135.9MB in the beginning and 133.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 22:59:04,904 INFO L158 Benchmark]: Boogie Preprocessor took 34.65ms. Allocated memory is still 190.8MB. Free memory was 133.1MB in the beginning and 129.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 22:59:04,905 INFO L158 Benchmark]: RCFGBuilder took 386.72ms. Allocated memory is still 190.8MB. Free memory was 129.6MB in the beginning and 111.4MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-20 22:59:04,905 INFO L158 Benchmark]: TraceAbstraction took 5055.77ms. Allocated memory was 190.8MB in the beginning and 291.5MB in the end (delta: 100.7MB). Free memory was 110.7MB in the beginning and 158.8MB in the end (delta: -48.1MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. [2023-12-20 22:59:04,906 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.51ms. Allocated memory is still 190.8MB. Free memory was 142.6MB in the beginning and 142.4MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 238.67ms. Allocated memory is still 190.8MB. Free memory was 148.5MB in the beginning and 135.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 51.38ms. Allocated memory is still 190.8MB. Free memory was 135.9MB in the beginning and 133.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.65ms. Allocated memory is still 190.8MB. Free memory was 133.1MB in the beginning and 129.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 386.72ms. Allocated memory is still 190.8MB. Free memory was 129.6MB in the beginning and 111.4MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 5055.77ms. Allocated memory was 190.8MB in the beginning and 291.5MB in the end (delta: 100.7MB). Free memory was 110.7MB in the beginning and 158.8MB in the end (delta: -48.1MB). Peak memory consumption was 53.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 77, overapproximation of bitwise operation at line 77. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 0; [L23] unsigned char var_1_2 = 0; [L24] unsigned short int var_1_3 = 1; [L25] unsigned short int var_1_4 = 19138; [L26] unsigned short int var_1_5 = 0; [L27] signed char var_1_6 = 25; [L28] signed long int var_1_7 = -50; [L29] double var_1_8 = 8.3; [L30] unsigned char var_1_9 = 128; [L31] unsigned char var_1_10 = 1; [L32] double var_1_11 = 256.2; [L81] isInitial = 1 [L82] FCALL initially() [L83] int k_loop; [L84] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L84] COND TRUE k_loop < 1 [L85] FCALL updateLastVariables() [L86] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] RET assume_abort_if_not(var_1_3 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L59] var_1_4 = __VERIFIER_nondet_ushort() [L60] CALL assume_abort_if_not(var_1_4 >= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L60] RET assume_abort_if_not(var_1_4 >= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] CALL assume_abort_if_not(var_1_4 <= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L61] RET assume_abort_if_not(var_1_4 <= 32767) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L62] var_1_5 = __VERIFIER_nondet_ushort() [L63] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L63] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L64] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L65] var_1_9 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_9 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L66] RET assume_abort_if_not(var_1_9 >= 127) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] CALL assume_abort_if_not(var_1_9 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L67] RET assume_abort_if_not(var_1_9 <= 255) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L68] var_1_10 = __VERIFIER_nondet_uchar() [L69] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L69] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] CALL assume_abort_if_not(var_1_10 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L70] RET assume_abort_if_not(var_1_10 <= 127) VAL [isInitial=1, var_1_10=127, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L71] var_1_11 = __VERIFIER_nondet_double() [L72] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L72] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=127, var_1_1=0, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L86] RET updateVariables() [L87] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L39] unsigned short int stepLocal_0 = var_1_4; [L40] EXPR var_1_5 << var_1_1 VAL [isInitial=1, stepLocal_0=16383, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, stepLocal_0=16383, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=255] [L40] COND TRUE stepLocal_0 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)))) [L41] var_1_7 = (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))) VAL [isInitial=1, stepLocal_0=16383, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L45] COND FALSE !((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) VAL [isInitial=1, stepLocal_0=16383, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=25, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L48] COND TRUE var_1_2 && (var_1_4 >= (var_1_3 + var_1_7)) [L49] var_1_6 = 8 VAL [isInitial=1, stepLocal_0=16383, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=8, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L87] RET step() [L88] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=8, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) [L77] EXPR var_1_5 << var_1_1 [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=8, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=8, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L88] RET, EXPR property() [L88] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=8, var_1_7=-1, var_1_8=83/10, var_1_9=255] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_1=840, var_1_2=1, var_1_3=16383, var_1_4=16383, var_1_5=16382, var_1_6=8, var_1_7=-1, var_1_8=83/10, var_1_9=255] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 6, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 437 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 824 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 568 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 821 IncrementalHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 256 mSDtfsCounter, 821 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 312 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 433 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=5, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 603 NumberOfCodeBlocks, 603 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 596 ConstructedInterpolants, 0 QuantifiedInterpolants, 4184 SizeOfPredicates, 11 NumberOfNonLiveVariables, 210 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 2085/2184 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-20 22:59:04,930 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...