/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-while_file-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 23:08:23,152 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 23:08:23,208 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 23:08:23,212 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 23:08:23,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 23:08:23,228 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 23:08:23,229 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 23:08:23,229 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 23:08:23,230 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 23:08:23,230 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 23:08:23,230 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 23:08:23,231 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 23:08:23,231 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 23:08:23,232 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 23:08:23,232 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 23:08:23,232 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 23:08:23,233 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 23:08:23,233 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 23:08:23,233 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 23:08:23,233 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 23:08:23,234 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 23:08:23,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 23:08:23,234 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 23:08:23,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 23:08:23,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 23:08:23,235 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 23:08:23,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 23:08:23,236 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 23:08:23,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 23:08:23,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 23:08:23,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 23:08:23,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 23:08:23,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:08:23,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 23:08:23,237 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 23:08:23,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 23:08:23,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 23:08:23,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 23:08:23,238 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 23:08:23,238 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 23:08:23,238 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 23:08:23,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 23:08:23,239 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 23:08:23,239 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 23:08:23,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 23:08:23,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 23:08:23,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 23:08:23,434 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 23:08:23,435 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 23:08:23,435 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2023-12-20 23:08:24,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 23:08:24,826 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 23:08:24,826 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-70.i [2023-12-20 23:08:24,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082bd22b4/04ac2f0dcbaa419e8eccdfe6dce48456/FLAG3deca1a27 [2023-12-20 23:08:24,844 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/082bd22b4/04ac2f0dcbaa419e8eccdfe6dce48456 [2023-12-20 23:08:24,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 23:08:24,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 23:08:24,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 23:08:24,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 23:08:24,854 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 23:08:24,855 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:08:24" (1/1) ... [2023-12-20 23:08:24,856 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e0c98a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:24, skipping insertion in model container [2023-12-20 23:08:24,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 11:08:24" (1/1) ... [2023-12-20 23:08:24,874 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 23:08:25,010 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-while_file-70.i[915,928] [2023-12-20 23:08:25,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:08:25,061 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 23:08:25,070 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-while_file-70.i[915,928] [2023-12-20 23:08:25,091 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 23:08:25,102 INFO L206 MainTranslator]: Completed translation [2023-12-20 23:08:25,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25 WrapperNode [2023-12-20 23:08:25,103 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 23:08:25,104 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 23:08:25,104 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 23:08:25,104 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 23:08:25,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,157 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 116 [2023-12-20 23:08:25,157 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 23:08:25,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 23:08:25,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 23:08:25,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 23:08:25,172 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,195 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 23:08:25,196 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,196 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 23:08:25,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 23:08:25,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 23:08:25,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 23:08:25,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (1/1) ... [2023-12-20 23:08:25,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 23:08:25,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 23:08:25,261 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 23:08:25,284 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 23:08:25,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 23:08:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 23:08:25,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 23:08:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 23:08:25,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 23:08:25,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 23:08:25,373 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 23:08:25,375 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 23:08:25,568 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 23:08:25,599 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 23:08:25,599 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 23:08:25,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:08:25 BoogieIcfgContainer [2023-12-20 23:08:25,600 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 23:08:25,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 23:08:25,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 23:08:25,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 23:08:25,609 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 11:08:24" (1/3) ... [2023-12-20 23:08:25,610 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2950b32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:08:25, skipping insertion in model container [2023-12-20 23:08:25,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 11:08:25" (2/3) ... [2023-12-20 23:08:25,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2950b32a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 11:08:25, skipping insertion in model container [2023-12-20 23:08:25,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 11:08:25" (3/3) ... [2023-12-20 23:08:25,612 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-70.i [2023-12-20 23:08:25,627 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 23:08:25,627 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 23:08:25,683 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 23:08:25,689 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;@7bfc1159, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 23:08:25,689 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 23:08:25,693 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 23:08:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 23:08:25,702 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:08:25,703 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 23:08:25,703 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:08:25,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:08:25,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1173626667, now seen corresponding path program 1 times [2023-12-20 23:08:25,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:08:25,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664428265] [2023-12-20 23:08:25,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:08:25,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:08:25,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:08:25,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:08:25,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:08:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:08:25,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:08:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:08:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:08:25,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:08:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:08:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:08:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:08:25,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:08:25,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:08:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:25,950 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 23:08:25,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:08:25,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664428265] [2023-12-20 23:08:25,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664428265] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:08:25,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:08:25,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 23:08:25,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597024029] [2023-12-20 23:08:25,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:08:25,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 23:08:25,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:08:25,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 23:08:25,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 23:08:25,984 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 23:08:26,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:08:26,027 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2023-12-20 23:08:26,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 23:08:26,030 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 23:08:26,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:08:26,037 INFO L225 Difference]: With dead ends: 83 [2023-12-20 23:08:26,037 INFO L226 Difference]: Without dead ends: 41 [2023-12-20 23:08:26,041 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 23:08:26,047 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 23:08:26,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:08:26,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-12-20 23:08:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-12-20 23:08:26,081 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 23:08:26,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 60 transitions. [2023-12-20 23:08:26,083 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 60 transitions. Word has length 85 [2023-12-20 23:08:26,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:08:26,084 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 60 transitions. [2023-12-20 23:08:26,084 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 23:08:26,084 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 60 transitions. [2023-12-20 23:08:26,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 23:08:26,087 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:08:26,088 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 23:08:26,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 23:08:26,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:08:26,089 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:08:26,089 INFO L85 PathProgramCache]: Analyzing trace with hash 878386093, now seen corresponding path program 1 times [2023-12-20 23:08:26,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:08:26,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394823717] [2023-12-20 23:08:26,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:08:26,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:08:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:08:27,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:08:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:08:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:08:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:08:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:08:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:08:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:08:27,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:08:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:08:27,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:08:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:08:27,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:08:27,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:27,591 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 23:08:27,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:08:27,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394823717] [2023-12-20 23:08:27,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394823717] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:08:27,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:08:27,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 23:08:27,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57299760] [2023-12-20 23:08:27,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:08:27,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 23:08:27,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:08:27,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 23:08:27,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-20 23:08:27,594 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 23:08:31,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 23:08:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:08:32,405 INFO L93 Difference]: Finished difference Result 96 states and 140 transitions. [2023-12-20 23:08:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 23:08:32,406 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 23:08:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:08:32,408 INFO L225 Difference]: With dead ends: 96 [2023-12-20 23:08:32,408 INFO L226 Difference]: Without dead ends: 56 [2023-12-20 23:08:32,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-20 23:08:32,409 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 29 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-20 23:08:32,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 127 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-20 23:08:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-20 23:08:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-12-20 23:08:32,426 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 23:08:32,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2023-12-20 23:08:32,430 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 85 [2023-12-20 23:08:32,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:08:32,431 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2023-12-20 23:08:32,431 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 23:08:32,431 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2023-12-20 23:08:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 23:08:32,433 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:08:32,433 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 23:08:32,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 23:08:32,433 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:08:32,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:08:32,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1579450671, now seen corresponding path program 1 times [2023-12-20 23:08:32,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:08:32,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858238652] [2023-12-20 23:08:32,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:08:32,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:08:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:08:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:08:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:08:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:08:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:08:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:08:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:08:32,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:08:32,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:08:32,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:08:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:08:32,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:08:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:08:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,522 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 23:08:32,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:08:32,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858238652] [2023-12-20 23:08:32,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858238652] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:08:32,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:08:32,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 23:08:32,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452458932] [2023-12-20 23:08:32,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:08:32,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 23:08:32,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:08:32,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 23:08:32,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 23:08:32,527 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23:08:32,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:08:32,568 INFO L93 Difference]: Finished difference Result 103 states and 150 transitions. [2023-12-20 23:08:32,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 23:08:32,569 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23:08:32,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:08:32,571 INFO L225 Difference]: With dead ends: 103 [2023-12-20 23:08:32,571 INFO L226 Difference]: Without dead ends: 56 [2023-12-20 23:08:32,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 23:08:32,574 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 15 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 23:08:32,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 118 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:08:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-20 23:08:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 48. [2023-12-20 23:08:32,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-12-20 23:08:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 70 transitions. [2023-12-20 23:08:32,594 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 70 transitions. Word has length 85 [2023-12-20 23:08:32,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:08:32,595 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 70 transitions. [2023-12-20 23:08:32,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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 23:08:32,595 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 70 transitions. [2023-12-20 23:08:32,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-12-20 23:08:32,596 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:08:32,597 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 23:08:32,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 23:08:32,597 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:08:32,597 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:08:32,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1636708973, now seen corresponding path program 1 times [2023-12-20 23:08:32,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:08:32,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551355918] [2023-12-20 23:08:32,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:08:32,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:08:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 23:08:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 23:08:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 23:08:32,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 23:08:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 23:08:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 23:08:32,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 23:08:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 23:08:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 23:08:32,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 23:08:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 23:08:32,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-20 23:08:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-20 23:08:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 23:08:32,791 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 23:08:32,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 23:08:32,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551355918] [2023-12-20 23:08:32,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551355918] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 23:08:32,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 23:08:32,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 23:08:32,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494906380] [2023-12-20 23:08:32,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 23:08:32,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 23:08:32,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 23:08:32,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 23:08:32,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 23:08:32,800 INFO L87 Difference]: Start difference. First operand 48 states and 70 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 23:08:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 23:08:32,844 INFO L93 Difference]: Finished difference Result 103 states and 148 transitions. [2023-12-20 23:08:32,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 23:08:32,845 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 23:08:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 23:08:32,847 INFO L225 Difference]: With dead ends: 103 [2023-12-20 23:08:32,847 INFO L226 Difference]: Without dead ends: 56 [2023-12-20 23:08:32,848 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 23:08:32,848 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 15 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 23:08:32,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 182 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 23:08:32,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-20 23:08:32,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 46. [2023-12-20 23:08:32,853 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 23:08:32,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 67 transitions. [2023-12-20 23:08:32,854 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 67 transitions. Word has length 85 [2023-12-20 23:08:32,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 23:08:32,854 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 67 transitions. [2023-12-20 23:08:32,854 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 23:08:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 67 transitions. [2023-12-20 23:08:32,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-20 23:08:32,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 23:08:32,858 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 23:08:32,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 23:08:32,859 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 23:08:32,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 23:08:32,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1996614290, now seen corresponding path program 1 times [2023-12-20 23:08:32,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 23:08:32,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450387285] [2023-12-20 23:08:32,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 23:08:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 23:08:32,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:08:32,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 23:08:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 23:08:32,989 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 23:08:32,990 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 23:08:32,990 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 23:08:32,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 23:08:32,995 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-20 23:08:32,998 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 23:08:33,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 11:08:33 BoogieIcfgContainer [2023-12-20 23:08:33,056 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 23:08:33,056 INFO L158 Benchmark]: Toolchain (without parser) took 8208.74ms. Allocated memory was 210.8MB in the beginning and 316.7MB in the end (delta: 105.9MB). Free memory was 163.4MB in the beginning and 219.0MB in the end (delta: -55.5MB). Peak memory consumption was 51.4MB. Max. memory is 8.0GB. [2023-12-20 23:08:33,056 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 23:08:33,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.62ms. Allocated memory is still 210.8MB. Free memory was 163.1MB in the beginning and 150.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 23:08:33,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.70ms. Allocated memory is still 210.8MB. Free memory was 150.5MB in the beginning and 147.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-20 23:08:33,059 INFO L158 Benchmark]: Boogie Preprocessor took 51.03ms. Allocated memory is still 210.8MB. Free memory was 147.7MB in the beginning and 144.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 23:08:33,059 INFO L158 Benchmark]: RCFGBuilder took 390.03ms. Allocated memory is still 210.8MB. Free memory was 144.2MB in the beginning and 126.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-20 23:08:33,060 INFO L158 Benchmark]: TraceAbstraction took 7449.49ms. Allocated memory was 210.8MB in the beginning and 316.7MB in the end (delta: 105.9MB). Free memory was 125.3MB in the beginning and 219.0MB in the end (delta: -93.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-20 23:08:33,063 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.13ms. Allocated memory is still 210.8MB. Free memory is still 164.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 254.62ms. Allocated memory is still 210.8MB. Free memory was 163.1MB in the beginning and 150.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.70ms. Allocated memory is still 210.8MB. Free memory was 150.5MB in the beginning and 147.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.03ms. Allocated memory is still 210.8MB. Free memory was 147.7MB in the beginning and 144.2MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 390.03ms. Allocated memory is still 210.8MB. Free memory was 144.2MB in the beginning and 126.0MB in the end (delta: 18.2MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 7449.49ms. Allocated memory was 210.8MB in the beginning and 316.7MB in the end (delta: 105.9MB). Free memory was 125.3MB in the beginning and 219.0MB in the end (delta: -93.6MB). Peak memory consumption was 12.6MB. 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] COND TRUE 1 [L84] FCALL updateLastVariables() [L85] CALL updateVariables() [L53] var_1_2 = __VERIFIER_nondet_uchar() [L54] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L54] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L55] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L56] var_1_3 = __VERIFIER_nondet_ushort() [L57] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L57] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_4=19138, var_1_5=0, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=128] [L58] CALL assume_abort_if_not(var_1_3 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=1281/5, var_1_1=0, var_1_2=1, var_1_3=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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=0, var_1_4=16383, var_1_5=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=0, var_1_4=16383, var_1_5=16383, 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=0, var_1_4=16383, var_1_5=16383, 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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L85] RET updateVariables() [L86] CALL step() [L36] COND TRUE \read(var_1_2) [L37] var_1_1 = ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)) VAL [isInitial=1, var_1_10=127, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [L40] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) [L40] EXPR var_1_5 << var_1_1 [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=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=-50, var_1_8=83/10, var_1_9=127] [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=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=16383, var_1_8=83/10, var_1_9=127] [L45] COND TRUE (var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3 [L46] var_1_8 = var_1_11 VAL [isInitial=1, stepLocal_0=16383, var_1_10=127, var_1_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=25, var_1_7=16383, var_1_8=19143, var_1_9=127] [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_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=8, var_1_7=16383, var_1_8=19143, var_1_9=127] [L86] RET step() [L87] CALL, EXPR property() [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) [L77] EXPR var_1_5 << var_1_1 VAL [isInitial=1, var_1_10=127, var_1_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=8, var_1_7=16383, var_1_8=19143, var_1_9=127] [L77] EXPR ((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1)) VAL [isInitial=1, var_1_10=127, var_1_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=8, var_1_7=16383, var_1_8=19143, var_1_9=127] [L77] EXPR ((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4))))) VAL [isInitial=1, var_1_10=127, var_1_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=8, var_1_7=16383, var_1_8=19143, var_1_9=127] [L77-L78] return (((var_1_2 ? (var_1_1 == ((unsigned short int) ((17222 - var_1_3) + (((((29916) < (var_1_4)) ? (29916) : (var_1_4))) - var_1_5)))) : 1) && ((var_1_2 && (var_1_4 >= (var_1_3 + var_1_7))) ? (var_1_6 == ((signed char) 8)) : 1)) && ((var_1_4 <= ((((var_1_3) > ((var_1_5 << var_1_1))) ? (var_1_3) : ((var_1_5 << var_1_1))))) ? (var_1_7 == ((signed long int) (((((var_1_5 - var_1_3)) < (var_1_4)) ? ((var_1_5 - var_1_3)) : (var_1_4))))) : (var_1_7 == ((signed long int) (var_1_5 + (var_1_1 + var_1_4)))))) && (((var_1_9 - ((((5) > (var_1_10)) ? (5) : (var_1_10)))) >= var_1_3) ? (var_1_8 == ((double) var_1_11)) : 1) ; [L87] RET, EXPR property() [L87] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=8, var_1_7=16383, var_1_8=19143, var_1_9=127] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=127, var_1_11=19143, var_1_1=17222, var_1_2=1, var_1_3=0, var_1_4=16383, var_1_5=16383, var_1_6=8, var_1_7=16383, var_1_8=19143, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.3s, OverallIterations: 5, TraceHistogramMax: 13, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 4.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 59 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 4.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 242 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 106 IncrementalHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 242 mSDtfsCounter, 106 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=2, InterpolantAutomatonStates: 16, 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, 4 MinimizatonAttempts, 26 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 336 ConstructedInterpolants, 0 QuantifiedInterpolants, 938 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1248/1248 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 23:08:33,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...