/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 18:51:14,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 18:51:14,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-20 18:51:14,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 18:51:14,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 18:51:14,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 18:51:14,148 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 18:51:14,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 18:51:14,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 18:51:14,150 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 18:51:14,150 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 18:51:14,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 18:51:14,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 18:51:14,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 18:51:14,152 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 18:51:14,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 18:51:14,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 18:51:14,153 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 18:51:14,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 18:51:14,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 18:51:14,154 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 18:51:14,154 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 18:51:14,154 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 18:51:14,155 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 18:51:14,155 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 18:51:14,155 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 18:51:14,156 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 18:51:14,156 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 18:51:14,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 18:51:14,157 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 18:51:14,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 18:51:14,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 18:51:14,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 18:51:14,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 18:51:14,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 18:51:14,158 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 18:51:14,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 18:51:14,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 18:51:14,159 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 18:51:14,159 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 18:51:14,160 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 18:51:14,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 18:51:14,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 18:51:14,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 18:51:14,362 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 18:51:14,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 18:51:14,386 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 18:51:14,387 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 18:51:14,388 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 18:51:14,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-97.i [2023-12-20 18:51:15,575 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 18:51:15,775 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 18:51:15,776 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_normal_file-97.i [2023-12-20 18:51:15,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845ad1659/a7be35d1efdf41d792c19d2e4a35075c/FLAG7538702e2 [2023-12-20 18:51:15,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/845ad1659/a7be35d1efdf41d792c19d2e4a35075c [2023-12-20 18:51:15,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 18:51:15,803 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 18:51:15,805 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 18:51:15,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 18:51:15,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 18:51:15,810 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 06:51:15" (1/1) ... [2023-12-20 18:51:15,811 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40db50f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:15, skipping insertion in model container [2023-12-20 18:51:15,811 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 06:51:15" (1/1) ... [2023-12-20 18:51:15,858 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 18:51:15,980 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_normal_file-97.i[913,926] [2023-12-20 18:51:16,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 18:51:16,088 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 18:51:16,101 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_normal_file-97.i[913,926] [2023-12-20 18:51:16,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 18:51:16,170 INFO L206 MainTranslator]: Completed translation [2023-12-20 18:51:16,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16 WrapperNode [2023-12-20 18:51:16,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 18:51:16,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 18:51:16,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 18:51:16,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 18:51:16,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,190 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,225 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2023-12-20 18:51:16,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 18:51:16,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 18:51:16,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 18:51:16,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 18:51:16,239 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,239 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,249 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,264 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 18:51:16,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,273 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,287 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,291 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,294 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 18:51:16,295 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 18:51:16,295 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 18:51:16,295 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 18:51:16,296 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (1/1) ... [2023-12-20 18:51:16,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 18:51:16,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 18:51:16,333 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-20 18:51:16,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-20 18:51:16,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 18:51:16,366 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 18:51:16,366 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 18:51:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 18:51:16,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 18:51:16,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 18:51:16,454 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 18:51:16,456 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 18:51:16,817 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 18:51:16,869 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 18:51:16,869 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 18:51:16,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 06:51:16 BoogieIcfgContainer [2023-12-20 18:51:16,870 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 18:51:16,872 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 18:51:16,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 18:51:16,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 18:51:16,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 06:51:15" (1/3) ... [2023-12-20 18:51:16,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ca172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 06:51:16, skipping insertion in model container [2023-12-20 18:51:16,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:51:16" (2/3) ... [2023-12-20 18:51:16,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ca172a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 06:51:16, skipping insertion in model container [2023-12-20 18:51:16,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 06:51:16" (3/3) ... [2023-12-20 18:51:16,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-97.i [2023-12-20 18:51:16,896 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 18:51:16,897 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 18:51:16,946 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 18:51:16,953 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;@5df22e61, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 18:51:16,954 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 18:51:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 18:51:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-20 18:51:16,977 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:51:16,978 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 18:51:16,978 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:51:16,982 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:51:16,982 INFO L85 PathProgramCache]: Analyzing trace with hash 925922992, now seen corresponding path program 1 times [2023-12-20 18:51:16,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:51:16,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120877857] [2023-12-20 18:51:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:51:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:51:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:51:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 18:51:17,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 18:51:17,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 18:51:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 18:51:17,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 18:51:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 18:51:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 18:51:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 18:51:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 18:51:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 18:51:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:51:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:51:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:51:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:51:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:51:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 18:51:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 18:51:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 18:51:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 18:51:17,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 18:51:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 18:51:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 18:51:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 18:51:17,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 18:51:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 18:51:17,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 18:51:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 18:51:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:17,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-12-20 18:51:17,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:51:17,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120877857] [2023-12-20 18:51:17,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120877857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:51:17,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:51:17,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 18:51:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112065001] [2023-12-20 18:51:17,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:51:17,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 18:51:17,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:51:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 18:51:17,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 18:51:17,443 INFO L87 Difference]: Start difference. First operand has 77 states, 46 states have (on average 1.434782608695652) internal successors, (66), 47 states have internal predecessors, (66), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-20 18:51:17,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:51:17,499 INFO L93 Difference]: Finished difference Result 149 states and 266 transitions. [2023-12-20 18:51:17,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 18:51:17,502 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 170 [2023-12-20 18:51:17,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:51:17,510 INFO L225 Difference]: With dead ends: 149 [2023-12-20 18:51:17,510 INFO L226 Difference]: Without dead ends: 73 [2023-12-20 18:51:17,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 18:51:17,520 INFO L413 NwaCegarLoop]: 108 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, 108 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-20 18:51:17,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:51:17,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-20 18:51:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-20 18:51:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 18:51:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 112 transitions. [2023-12-20 18:51:17,583 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 112 transitions. Word has length 170 [2023-12-20 18:51:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:51:17,584 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 112 transitions. [2023-12-20 18:51:17,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2023-12-20 18:51:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 112 transitions. [2023-12-20 18:51:17,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-12-20 18:51:17,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:51:17,595 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 18:51:17,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 18:51:17,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:51:17,596 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:51:17,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2100954508, now seen corresponding path program 1 times [2023-12-20 18:51:17,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:51:17,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918760891] [2023-12-20 18:51:17,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:51:17,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:51:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:51:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 18:51:18,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 18:51:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 18:51:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 18:51:18,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 18:51:18,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 18:51:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 18:51:18,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 18:51:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 18:51:18,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 18:51:18,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:51:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:51:18,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:51:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:51:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:51:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 18:51:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 18:51:18,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 18:51:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 18:51:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 18:51:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 18:51:18,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 18:51:18,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 18:51:18,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 18:51:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 18:51:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 18:51:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 18:51:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:18,411 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-12-20 18:51:18,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:51:18,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918760891] [2023-12-20 18:51:18,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918760891] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:51:18,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:51:18,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 18:51:18,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294172354] [2023-12-20 18:51:18,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:51:18,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 18:51:18,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:51:18,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 18:51:18,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 18:51:18,420 INFO L87 Difference]: Start difference. First operand 73 states and 112 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-20 18:51:18,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:51:18,498 INFO L93 Difference]: Finished difference Result 146 states and 224 transitions. [2023-12-20 18:51:18,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 18:51:18,500 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 170 [2023-12-20 18:51:18,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:51:18,503 INFO L225 Difference]: With dead ends: 146 [2023-12-20 18:51:18,503 INFO L226 Difference]: Without dead ends: 74 [2023-12-20 18:51:18,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-20 18:51:18,505 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 35 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 18:51:18,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 273 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:51:18,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-20 18:51:18,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2023-12-20 18:51:18,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 43 states have (on average 1.2790697674418605) internal successors, (55), 43 states have internal predecessors, (55), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 18:51:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 111 transitions. [2023-12-20 18:51:18,515 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 111 transitions. Word has length 170 [2023-12-20 18:51:18,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:51:18,516 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 111 transitions. [2023-12-20 18:51:18,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-20 18:51:18,517 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 111 transitions. [2023-12-20 18:51:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 18:51:18,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:51:18,519 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 18:51:18,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 18:51:18,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:51:18,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:51:18,520 INFO L85 PathProgramCache]: Analyzing trace with hash 814340569, now seen corresponding path program 1 times [2023-12-20 18:51:18,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:51:18,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927409115] [2023-12-20 18:51:18,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:51:18,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:51:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:51:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-20 18:51:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-20 18:51:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-20 18:51:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-20 18:51:27,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-20 18:51:27,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-20 18:51:27,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-12-20 18:51:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-12-20 18:51:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-12-20 18:51:27,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-12-20 18:51:27,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:51:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:51:27,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:51:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:51:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:51:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2023-12-20 18:51:27,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-12-20 18:51:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-12-20 18:51:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-12-20 18:51:27,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-12-20 18:51:27,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-12-20 18:51:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-12-20 18:51:27,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2023-12-20 18:51:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-12-20 18:51:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-12-20 18:51:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-12-20 18:51:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2023-12-20 18:51:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:51:27,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-12-20 18:51:27,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:51:27,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927409115] [2023-12-20 18:51:27,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927409115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:51:27,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:51:27,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-20 18:51:27,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205270733] [2023-12-20 18:51:27,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:51:27,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-20 18:51:27,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:51:27,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-20 18:51:27,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-20 18:51:27,559 INFO L87 Difference]: Start difference. First operand 73 states and 111 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-20 18:51:42,677 WARN L293 SmtUtils]: Spent 8.86s on a formula simplification that was a NOOP. DAG size: 144 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-20 18:51:43,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:51:43,271 INFO L93 Difference]: Finished difference Result 192 states and 285 transitions. [2023-12-20 18:51:43,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-20 18:51:43,274 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 172 [2023-12-20 18:51:43,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:51:43,277 INFO L225 Difference]: With dead ends: 192 [2023-12-20 18:51:43,277 INFO L226 Difference]: Without dead ends: 120 [2023-12-20 18:51:43,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-12-20 18:51:43,279 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 78 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-20 18:51:43,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 565 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-20 18:51:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-12-20 18:51:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 84. [2023-12-20 18:51:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-20 18:51:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 127 transitions. [2023-12-20 18:51:43,291 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 127 transitions. Word has length 172 [2023-12-20 18:51:43,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:51:43,291 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 127 transitions. [2023-12-20 18:51:43,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2023-12-20 18:51:43,292 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 127 transitions. [2023-12-20 18:51:43,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-12-20 18:51:43,293 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:51:43,294 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 18:51:43,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 18:51:43,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:51:43,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:51:43,294 INFO L85 PathProgramCache]: Analyzing trace with hash 227534555, now seen corresponding path program 1 times [2023-12-20 18:51:43,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:51:43,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049032551] [2023-12-20 18:51:43,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:51:43,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:51:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 18:51:43,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 18:51:43,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 18:51:43,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 18:51:43,433 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 18:51:43,434 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 18:51:43,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 18:51:43,439 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-12-20 18:51:43,442 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 18:51:43,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 06:51:43 BoogieIcfgContainer [2023-12-20 18:51:43,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 18:51:43,546 INFO L158 Benchmark]: Toolchain (without parser) took 27742.82ms. Allocated memory was 183.5MB in the beginning and 305.1MB in the end (delta: 121.6MB). Free memory was 136.0MB in the beginning and 270.4MB in the end (delta: -134.4MB). Peak memory consumption was 162.2MB. Max. memory is 8.0GB. [2023-12-20 18:51:43,547 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 138.3MB in the beginning and 138.2MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 18:51:43,547 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.34ms. Allocated memory is still 183.5MB. Free memory was 136.0MB in the beginning and 121.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-20 18:51:43,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.73ms. Allocated memory is still 183.5MB. Free memory was 121.5MB in the beginning and 117.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 18:51:43,547 INFO L158 Benchmark]: Boogie Preprocessor took 66.87ms. Allocated memory is still 183.5MB. Free memory was 117.1MB in the beginning and 110.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-20 18:51:43,548 INFO L158 Benchmark]: RCFGBuilder took 574.48ms. Allocated memory is still 183.5MB. Free memory was 110.8MB in the beginning and 140.9MB in the end (delta: -30.1MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. [2023-12-20 18:51:43,548 INFO L158 Benchmark]: TraceAbstraction took 26673.95ms. Allocated memory was 183.5MB in the beginning and 305.1MB in the end (delta: 121.6MB). Free memory was 140.4MB in the beginning and 270.4MB in the end (delta: -130.0MB). Peak memory consumption was 165.2MB. Max. memory is 8.0GB. [2023-12-20 18:51:43,550 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory was 138.3MB in the beginning and 138.2MB in the end (delta: 77.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 366.34ms. Allocated memory is still 183.5MB. Free memory was 136.0MB in the beginning and 121.5MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.73ms. Allocated memory is still 183.5MB. Free memory was 121.5MB in the beginning and 117.1MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.87ms. Allocated memory is still 183.5MB. Free memory was 117.1MB in the beginning and 110.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 574.48ms. Allocated memory is still 183.5MB. Free memory was 110.8MB in the beginning and 140.9MB in the end (delta: -30.1MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. * TraceAbstraction took 26673.95ms. Allocated memory was 183.5MB in the beginning and 305.1MB in the end (delta: 121.6MB). Free memory was 140.4MB in the beginning and 270.4MB in the end (delta: -130.0MB). Peak memory consumption was 165.2MB. 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 139, overapproximation of bitwise operation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] unsigned short int var_1_2 = 16; [L24] unsigned short int var_1_3 = 32; [L25] unsigned char var_1_4 = 1; [L26] signed long int var_1_5 = 5; [L27] signed long int var_1_6 = 2; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 0; [L30] float var_1_9 = 128.6; [L31] float var_1_10 = 32.5; [L32] unsigned char var_1_11 = 16; [L33] unsigned char var_1_12 = 64; [L34] unsigned char var_1_13 = 4; [L35] unsigned char var_1_14 = 4; [L36] unsigned long int var_1_15 = 0; [L37] signed short int var_1_16 = 0; [L38] signed char var_1_17 = 1; [L39] signed char var_1_18 = -1; [L40] signed char var_1_19 = 0; [L41] signed long int var_1_20 = -64; [L42] signed long int var_1_21 = 25; [L43] unsigned char var_1_22 = 0; [L44] unsigned char var_1_23 = 0; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L92] var_1_2 = __VERIFIER_nondet_ushort() [L93] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L93] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] CALL assume_abort_if_not(var_1_2 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L94] RET assume_abort_if_not(var_1_2 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_3=32, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L95] var_1_3 = __VERIFIER_nondet_ushort() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] CALL assume_abort_if_not(var_1_3 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L97] RET assume_abort_if_not(var_1_3 <= 65535) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=1, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L99] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L100] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=2, var_1_7=1, var_1_8=0, var_1_9=643/5] [L101] var_1_6 = __VERIFIER_nondet_long() [L102] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L102] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] CALL assume_abort_if_not(var_1_6 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L103] RET assume_abort_if_not(var_1_6 <= 1073741823) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L104] var_1_7 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L105] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_8=0, var_1_9=643/5] [L106] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L106] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0, var_1_9=643/5] [L107] var_1_9 = __VERIFIER_nondet_float() [L108] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L108] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L109] var_1_10 = __VERIFIER_nondet_float() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L111] var_1_11 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L112] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L113] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L114] var_1_12 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L115] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L116] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L117] var_1_13 = __VERIFIER_nondet_uchar() [L118] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L118] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L119] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L120] var_1_14 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L121] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L122] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L123] var_1_18 = __VERIFIER_nondet_char() [L124] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L124] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L125] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L126] var_1_19 = __VERIFIER_nondet_char() [L127] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L127] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L128] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=25, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L129] var_1_21 = __VERIFIER_nondet_long() [L130] CALL assume_abort_if_not(var_1_21 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L130] RET assume_abort_if_not(var_1_21 >= -2147483647) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] CALL assume_abort_if_not(var_1_21 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L131] RET assume_abort_if_not(var_1_21 <= 2147483646) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L132] var_1_23 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L133] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L134] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L147] RET updateVariables() [L148] CALL step() [L48] COND FALSE !((var_1_2 + var_1_3) < -200) [L59] var_1_1 = var_1_2 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_4=0, var_1_5=5, var_1_6=0, var_1_7=1, var_1_8=0] [L61] COND TRUE 256 > (var_1_3 - (var_1_2 + var_1_6)) [L62] var_1_5 = var_1_2 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L72] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L75] COND TRUE \read(var_1_7) [L76] var_1_15 = var_1_6 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L78] var_1_16 = (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L79] COND FALSE !(\read(var_1_4)) [L86] var_1_17 = -32 VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=-64, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L88] var_1_20 = var_1_21 [L89] var_1_22 = var_1_23 [L148] RET step() [L149] CALL, EXPR property() [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139] EXPR (((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32))) VAL [isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L139-L140] return (((((((((var_1_2 + var_1_3) < -200) ? (var_1_4 ? ((var_1_2 > (- var_1_3)) ? (var_1_1 == ((unsigned long int) var_1_2)) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) : (var_1_1 == ((unsigned long int) var_1_2))) && ((256 > (var_1_3 - (var_1_2 + var_1_6))) ? (var_1_5 == ((signed long int) var_1_2)) : ((var_1_4 || var_1_7) ? ((((32 * -25) | var_1_2) >= var_1_3) ? (var_1_5 == ((signed long int) var_1_6)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_7 ? (var_1_15 == ((unsigned long int) var_1_6)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_8) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_8) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_4 ? ((var_1_14 < (var_1_13 & (var_1_16 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_21))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=121, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=32, var_1_19=0, var_1_1=0, var_1_20=2147483646, var_1_21=2147483646, var_1_22=0, var_1_23=0, var_1_2=0, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.5s, OverallIterations: 4, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 113 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 946 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 635 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 228 IncrementalHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 311 mSDtfsCounter, 228 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 217 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 16.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=3, InterpolantAutomatonStates: 18, 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, 3 MinimizatonAttempts, 37 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.9s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 509 ConstructedInterpolants, 0 QuantifiedInterpolants, 5841 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 4536/4536 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-20 18:51:43,579 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...