/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-27.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 05:36:42,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 05:36:42,121 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 05:36:42,125 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 05:36:42,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 05:36:42,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 05:36:42,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 05:36:42,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 05:36:42,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 05:36:42,158 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 05:36:42,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 05:36:42,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 05:36:42,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 05:36:42,160 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 05:36:42,160 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 05:36:42,160 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 05:36:42,160 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 05:36:42,161 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 05:36:42,162 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 05:36:42,162 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 05:36:42,162 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 05:36:42,162 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 05:36:42,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 05:36:42,163 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 05:36:42,163 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 05:36:42,163 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 05:36:42,163 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 05:36:42,164 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 05:36:42,164 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 05:36:42,164 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 05:36:42,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 05:36:42,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 05:36:42,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:36:42,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 05:36:42,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 05:36:42,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 05:36:42,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 05:36:42,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 05:36:42,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 05:36:42,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 05:36:42,167 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 05:36:42,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 05:36:42,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 05:36:42,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 05:36:42,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 05:36:42,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 05:36:42,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 05:36:42,416 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 05:36:42,416 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 05:36:42,417 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-12-19 05:36:43,540 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 05:36:43,736 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 05:36:43,737 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-27.i [2023-12-19 05:36:43,748 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5bb6b47/bffe4ffd460248779b4f85e344d23254/FLAG71ad01418 [2023-12-19 05:36:43,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba5bb6b47/bffe4ffd460248779b4f85e344d23254 [2023-12-19 05:36:43,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 05:36:43,770 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 05:36:43,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 05:36:43,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 05:36:43,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 05:36:43,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:36:43" (1/1) ... [2023-12-19 05:36:43,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5647fdcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:43, skipping insertion in model container [2023-12-19 05:36:43,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:36:43" (1/1) ... [2023-12-19 05:36:43,818 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 05:36:43,963 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_codestructure_dependencies_file-27.i[919,932] [2023-12-19 05:36:44,015 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:36:44,024 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 05:36:44,033 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_codestructure_dependencies_file-27.i[919,932] [2023-12-19 05:36:44,056 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:36:44,072 INFO L206 MainTranslator]: Completed translation [2023-12-19 05:36:44,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44 WrapperNode [2023-12-19 05:36:44,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 05:36:44,073 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 05:36:44,073 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 05:36:44,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 05:36:44,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,090 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,120 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 149 [2023-12-19 05:36:44,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 05:36:44,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 05:36:44,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 05:36:44,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 05:36:44,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,131 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,134 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,145 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 05:36:44,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,152 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,155 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,158 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 05:36:44,178 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 05:36:44,178 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 05:36:44,178 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 05:36:44,179 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (1/1) ... [2023-12-19 05:36:44,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:36:44,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:36:44,214 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 05:36:44,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 05:36:44,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 05:36:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 05:36:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 05:36:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 05:36:44,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 05:36:44,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 05:36:44,294 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 05:36:44,295 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 05:36:44,576 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 05:36:44,629 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 05:36:44,640 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 05:36:44,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:36:44 BoogieIcfgContainer [2023-12-19 05:36:44,641 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 05:36:44,662 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 05:36:44,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 05:36:44,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 05:36:44,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:36:43" (1/3) ... [2023-12-19 05:36:44,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0b8c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:36:44, skipping insertion in model container [2023-12-19 05:36:44,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:36:44" (2/3) ... [2023-12-19 05:36:44,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b0b8c49 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:36:44, skipping insertion in model container [2023-12-19 05:36:44,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:36:44" (3/3) ... [2023-12-19 05:36:44,668 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-27.i [2023-12-19 05:36:44,682 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 05:36:44,683 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 05:36:44,721 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 05:36:44,728 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;@34a73e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 05:36:44,728 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 05:36:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 05:36:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-19 05:36:44,749 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:44,749 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 05:36:44,750 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:44,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:44,756 INFO L85 PathProgramCache]: Analyzing trace with hash 96445642, now seen corresponding path program 1 times [2023-12-19 05:36:44,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:44,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791357985] [2023-12-19 05:36:44,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:44,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:44,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:45,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:45,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:36:45,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:36:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 05:36:45,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 05:36:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:36:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:36:45,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 05:36:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 05:36:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 05:36:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 05:36:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:36:45,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 05:36:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:36:45,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 05:36:45,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:36:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,134 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 05:36:45,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:45,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791357985] [2023-12-19 05:36:45,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791357985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:36:45,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:36:45,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 05:36:45,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764418164] [2023-12-19 05:36:45,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:36:45,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 05:36:45,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:45,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 05:36:45,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 05:36:45,185 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 39 states have internal predecessors, (56), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 05:36:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:45,252 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2023-12-19 05:36:45,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 05:36:45,259 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 126 [2023-12-19 05:36:45,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:45,266 INFO L225 Difference]: With dead ends: 119 [2023-12-19 05:36:45,267 INFO L226 Difference]: Without dead ends: 59 [2023-12-19 05:36:45,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 05:36:45,273 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:36:45,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:36:45,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-12-19 05:36:45,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-12-19 05:36:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 37 states have internal predecessors, (51), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-19 05:36:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 91 transitions. [2023-12-19 05:36:45,324 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 91 transitions. Word has length 126 [2023-12-19 05:36:45,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:45,324 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 91 transitions. [2023-12-19 05:36:45,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-12-19 05:36:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 91 transitions. [2023-12-19 05:36:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2023-12-19 05:36:45,332 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:45,332 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 05:36:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 05:36:45,333 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:45,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:45,334 INFO L85 PathProgramCache]: Analyzing trace with hash -501764414, now seen corresponding path program 1 times [2023-12-19 05:36:45,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:45,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277628017] [2023-12-19 05:36:45,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:45,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:45,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:36:45,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:36:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 05:36:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 05:36:45,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:36:45,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:36:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 05:36:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 05:36:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 05:36:45,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 05:36:45,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:36:45,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 05:36:45,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:36:45,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 05:36:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:36:45,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:45,823 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 05:36:45,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:45,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277628017] [2023-12-19 05:36:45,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277628017] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:36:45,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:36:45,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 05:36:45,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573471401] [2023-12-19 05:36:45,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:36:45,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 05:36:45,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 05:36:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 05:36:45,832 INFO L87 Difference]: Start difference. First operand 59 states and 91 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 05:36:45,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:45,896 INFO L93 Difference]: Finished difference Result 175 states and 271 transitions. [2023-12-19 05:36:45,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 05:36:45,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 126 [2023-12-19 05:36:45,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:45,901 INFO L225 Difference]: With dead ends: 175 [2023-12-19 05:36:45,901 INFO L226 Difference]: Without dead ends: 117 [2023-12-19 05:36:45,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 05:36:45,905 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 47 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:36:45,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 165 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:36:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-12-19 05:36:45,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2023-12-19 05:36:45,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 70 states have internal predecessors, (94), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 05:36:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 174 transitions. [2023-12-19 05:36:45,942 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 174 transitions. Word has length 126 [2023-12-19 05:36:45,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:45,944 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 174 transitions. [2023-12-19 05:36:45,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 05:36:45,944 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 174 transitions. [2023-12-19 05:36:45,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 05:36:45,946 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:45,946 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 05:36:45,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 05:36:45,947 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:45,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:45,947 INFO L85 PathProgramCache]: Analyzing trace with hash 232534288, now seen corresponding path program 1 times [2023-12-19 05:36:45,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:45,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441637222] [2023-12-19 05:36:45,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:45,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:46,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:46,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:46,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:46,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:36:46,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:36:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 05:36:46,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 05:36:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:36:46,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:36:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 05:36:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 05:36:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 05:36:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 05:36:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:36:46,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 05:36:46,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:36:46,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 05:36:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:36:46,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,314 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 05:36:46,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:46,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441637222] [2023-12-19 05:36:46,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441637222] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:36:46,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:36:46,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:36:46,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507409802] [2023-12-19 05:36:46,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:36:46,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:36:46,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:46,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:36:46,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:36:46,320 INFO L87 Difference]: Start difference. First operand 113 states and 174 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 05:36:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:46,465 INFO L93 Difference]: Finished difference Result 227 states and 351 transitions. [2023-12-19 05:36:46,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 05:36:46,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-12-19 05:36:46,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:46,467 INFO L225 Difference]: With dead ends: 227 [2023-12-19 05:36:46,467 INFO L226 Difference]: Without dead ends: 115 [2023-12-19 05:36:46,468 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:36:46,469 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 89 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:36:46,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:36:46,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-19 05:36:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-12-19 05:36:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 72 states have (on average 1.3333333333333333) internal successors, (96), 72 states have internal predecessors, (96), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 05:36:46,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 176 transitions. [2023-12-19 05:36:46,487 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 176 transitions. Word has length 127 [2023-12-19 05:36:46,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:46,487 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 176 transitions. [2023-12-19 05:36:46,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 05:36:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 176 transitions. [2023-12-19 05:36:46,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-12-19 05:36:46,490 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:46,492 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 05:36:46,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 05:36:46,494 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:46,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 933598866, now seen corresponding path program 1 times [2023-12-19 05:36:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:46,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124495047] [2023-12-19 05:36:46,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:46,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:36:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:36:46,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:36:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:36:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:36:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-19 05:36:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-19 05:36:46,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-12-19 05:36:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2023-12-19 05:36:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:36:46,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:36:46,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2023-12-19 05:36:46,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2023-12-19 05:36:46,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2023-12-19 05:36:46,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-12-19 05:36:46,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-19 05:36:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-19 05:36:46,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-12-19 05:36:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-12-19 05:36:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-12-19 05:36:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:36:46,751 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-12-19 05:36:46,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:36:46,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124495047] [2023-12-19 05:36:46,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124495047] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:36:46,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:36:46,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:36:46,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668174906] [2023-12-19 05:36:46,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:36:46,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:36:46,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:36:46,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:36:46,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:36:46,754 INFO L87 Difference]: Start difference. First operand 115 states and 176 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 05:36:46,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:36:46,878 INFO L93 Difference]: Finished difference Result 229 states and 351 transitions. [2023-12-19 05:36:46,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 05:36:46,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 127 [2023-12-19 05:36:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:36:46,883 INFO L225 Difference]: With dead ends: 229 [2023-12-19 05:36:46,883 INFO L226 Difference]: Without dead ends: 115 [2023-12-19 05:36:46,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:36:46,890 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 88 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:36:46,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:36:46,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-19 05:36:46,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2023-12-19 05:36:46,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 70 states have internal predecessors, (92), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2023-12-19 05:36:46,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2023-12-19 05:36:46,920 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 127 [2023-12-19 05:36:46,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:36:46,921 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2023-12-19 05:36:46,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-12-19 05:36:46,921 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2023-12-19 05:36:46,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-12-19 05:36:46,922 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:36:46,923 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 05:36:46,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 05:36:46,923 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:36:46,923 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:36:46,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1803996711, now seen corresponding path program 1 times [2023-12-19 05:36:46,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:36:46,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [237099060] [2023-12-19 05:36:46,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:36:46,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:36:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:36:47,022 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 05:36:47,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:36:47,131 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 05:36:47,131 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 05:36:47,132 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 05:36:47,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 05:36:47,137 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-19 05:36:47,140 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 05:36:47,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:36:47 BoogieIcfgContainer [2023-12-19 05:36:47,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 05:36:47,224 INFO L158 Benchmark]: Toolchain (without parser) took 3454.05ms. Allocated memory was 194.0MB in the beginning and 292.6MB in the end (delta: 98.6MB). Free memory was 140.6MB in the beginning and 172.8MB in the end (delta: -32.2MB). Peak memory consumption was 67.2MB. Max. memory is 8.0GB. [2023-12-19 05:36:47,224 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 194.0MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 05:36:47,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.74ms. Allocated memory is still 194.0MB. Free memory was 140.6MB in the beginning and 126.8MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 05:36:47,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.87ms. Allocated memory is still 194.0MB. Free memory was 126.8MB in the beginning and 124.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 05:36:47,225 INFO L158 Benchmark]: Boogie Preprocessor took 56.40ms. Allocated memory is still 194.0MB. Free memory was 124.0MB in the beginning and 120.5MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 05:36:47,225 INFO L158 Benchmark]: RCFGBuilder took 463.36ms. Allocated memory is still 194.0MB. Free memory was 120.1MB in the beginning and 98.8MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2023-12-19 05:36:47,225 INFO L158 Benchmark]: TraceAbstraction took 2561.78ms. Allocated memory is still 292.6MB. Free memory was 259.7MB in the beginning and 172.8MB in the end (delta: 86.9MB). Peak memory consumption was 86.0MB. Max. memory is 8.0GB. [2023-12-19 05:36:47,226 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.12ms. Allocated memory is still 194.0MB. Free memory is still 141.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 299.74ms. Allocated memory is still 194.0MB. Free memory was 140.6MB in the beginning and 126.8MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.87ms. Allocated memory is still 194.0MB. Free memory was 126.8MB in the beginning and 124.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 56.40ms. Allocated memory is still 194.0MB. Free memory was 124.0MB in the beginning and 120.5MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 463.36ms. Allocated memory is still 194.0MB. Free memory was 120.1MB in the beginning and 98.8MB in the end (delta: 21.3MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2561.78ms. Allocated memory is still 292.6MB. Free memory was 259.7MB in the beginning and 172.8MB in the end (delta: 86.9MB). Peak memory consumption was 86.0MB. 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 someBinaryFLOATComparisonOperation at line 123, overapproximation of someBinaryArithmeticFLOAToperation at line 70. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 3.9; [L23] unsigned char var_1_2 = 0; [L24] unsigned char var_1_3 = 0; [L25] float var_1_4 = 31.5; [L26] float var_1_5 = 25.4; [L27] float var_1_6 = 9.5; [L28] float var_1_7 = 63.2; [L29] unsigned long int var_1_8 = 1; [L30] signed short int var_1_10 = -50; [L31] unsigned long int var_1_11 = 8; [L32] unsigned char var_1_12 = 32; [L33] float var_1_13 = 15.625; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 1; [L37] unsigned char var_1_17 = 1; [L38] unsigned char var_1_19 = 0; [L39] unsigned char var_1_20 = 8; [L40] unsigned short int var_1_21 = 16; [L41] unsigned short int var_1_22 = 128; [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] FCALL updateLastVariables() [L131] CALL updateVariables() [L87] var_1_2 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L88] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L89] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=0, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L90] var_1_3 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L91] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L92] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_4=63/2, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L93] var_1_4 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L94] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_5=127/5, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L95] var_1_5 = __VERIFIER_nondet_float() [L96] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L96] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_6=19/2, var_1_7=316/5, var_1_8=1] [L97] var_1_6 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L98] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_7=316/5, var_1_8=1] [L99] var_1_7 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L100] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=8, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L101] var_1_11 = __VERIFIER_nondet_ulong() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L103] CALL assume_abort_if_not(var_1_11 <= 33) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L103] RET assume_abort_if_not(var_1_11 <= 33) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_13=125/8, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L104] var_1_13 = __VERIFIER_nondet_float() [L105] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L105] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L106] CALL assume_abort_if_not(var_1_13 != 0.0F) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L106] RET assume_abort_if_not(var_1_13 != 0.0F) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=0, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L107] var_1_15 = __VERIFIER_nondet_uchar() [L108] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L108] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L109] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L109] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L110] var_1_16 = __VERIFIER_nondet_uchar() [L111] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L111] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L112] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L112] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L113] var_1_17 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L114] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L115] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L115] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L116] var_1_19 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L117] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L118] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L118] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=32, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L131] RET updateVariables() [L132] CALL step() [L45] COND TRUE var_1_6 == (var_1_4 / var_1_13) [L46] var_1_12 = var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=8, var_1_21=16, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L48] var_1_20 = var_1_11 [L49] var_1_21 = 8 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L50] EXPR 2u >> var_1_11 VAL [isInitial=1, var_1_10=-50, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L50] COND TRUE (var_1_21 + var_1_12) > (2u >> var_1_11) [L51] COND TRUE var_1_12 != var_1_21 [L52] var_1_10 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L57] COND FALSE !(! var_1_2) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L68] COND TRUE var_1_14 || var_1_14 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_1=39/10, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L69] COND TRUE var_1_14 || var_1_14 [L70] var_1_1 = (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=1] [L77] COND FALSE !(var_1_6 > (- var_1_7)) [L82] var_1_8 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=128, var_1_2=1, var_1_3=1, var_1_8=0] [L84] var_1_22 = var_1_8 [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] [L123-L124] return ((((((((var_1_14 || var_1_14) ? ((var_1_14 || var_1_14) ? (var_1_1 == ((float) (((((((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) > (var_1_6)) ? (((((var_1_4) < (var_1_5)) ? (var_1_4) : (var_1_5)))) : (var_1_6))) - var_1_7))) : (var_1_1 == ((float) 1.0000000075E8f))) : (var_1_1 == ((float) var_1_7))) && ((var_1_6 > (- var_1_7)) ? ((var_1_5 == (((((var_1_6 * var_1_7)) > (var_1_1)) ? ((var_1_6 * var_1_7)) : (var_1_1)))) ? (var_1_8 == ((unsigned long int) 8u)) : 1) : (var_1_8 == ((unsigned long int) var_1_20)))) && (((var_1_21 + var_1_12) > (2u >> var_1_11)) ? ((var_1_12 != var_1_21) ? (var_1_10 == ((signed short int) var_1_11)) : (var_1_10 == ((signed short int) 128))) : 1)) && ((var_1_6 == (var_1_4 / var_1_13)) ? (var_1_12 == ((unsigned char) var_1_11)) : 1)) && ((! var_1_2) ? ((var_1_2 || var_1_3) ? (var_1_14 == ((unsigned char) ((! (! var_1_15)) && (var_1_16 && var_1_17)))) : ((((((var_1_12) > (var_1_12)) ? (var_1_12) : (var_1_12))) >= var_1_21) ? (var_1_14 == ((unsigned char) (var_1_2 || var_1_16))) : (var_1_14 == ((unsigned char) (! var_1_19))))) : 1)) && (var_1_20 == ((unsigned char) var_1_11))) && (var_1_21 == ((unsigned short int) 8))) && (var_1_22 == ((unsigned short int) var_1_8)) ; [L133] RET, EXPR property() [L133] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=1, var_1_19=0, var_1_20=0, var_1_21=8, var_1_22=0, var_1_2=1, var_1_3=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 5, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 224 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 224 mSDsluCounter, 484 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 152 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 332 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 196 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115occurred in iteration=3, InterpolantAutomatonStates: 13, 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, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 634 NumberOfCodeBlocks, 634 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 623 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 3040/3040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 05:36:47,248 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...