./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:25:03,165 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:25:03,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:25:03,235 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:25:03,236 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:25:03,266 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:25:03,266 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:25:03,267 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:25:03,268 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:25:03,268 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:25:03,269 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:25:03,269 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:25:03,270 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:25:03,271 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:25:03,272 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:25:03,272 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:25:03,273 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:25:03,273 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:25:03,273 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:25:03,273 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:25:03,274 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:25:03,278 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:25:03,278 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:25:03,279 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:25:03,279 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:25:03,279 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:25:03,279 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:25:03,280 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:25:03,280 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:25:03,280 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:25:03,280 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:25:03,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:25:03,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:25:03,281 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:25:03,281 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:25:03,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:25:03,282 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:25:03,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:25:03,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:25:03,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:25:03,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:25:03,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:25:03,283 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 [2024-10-11 08:25:03,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:25:03,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:25:03,604 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:25:03,605 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:25:03,605 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:25:03,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-11 08:25:05,090 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:25:05,349 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:25:05,350 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-11 08:25:05,359 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af2f28d26/445cbf2c8d764c559ab3d0d0f99fc9e7/FLAGc65e83450 [2024-10-11 08:25:05,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/af2f28d26/445cbf2c8d764c559ab3d0d0f99fc9e7 [2024-10-11 08:25:05,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:25:05,656 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:25:05,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:25:05,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:25:05,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:25:05,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:05" (1/1) ... [2024-10-11 08:25:05,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60958f64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:05, skipping insertion in model container [2024-10-11 08:25:05,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:05" (1/1) ... [2024-10-11 08:25:05,704 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:25:05,889 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i[915,928] [2024-10-11 08:25:05,961 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:25:05,979 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:25:05,992 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i[915,928] [2024-10-11 08:25:06,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:25:06,064 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:25:06,064 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06 WrapperNode [2024-10-11 08:25:06,065 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:25:06,066 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:25:06,066 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:25:06,066 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:25:06,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,091 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,125 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2024-10-11 08:25:06,125 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:25:06,126 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:25:06,126 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:25:06,126 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:25:06,144 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,147 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,180 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]. [2024-10-11 08:25:06,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,182 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,192 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,196 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:25:06,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:25:06,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:25:06,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:25:06,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (1/1) ... [2024-10-11 08:25:06,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:25:06,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:25:06,246 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:25:06,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:25:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:25:06,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:25:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:25:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:25:06,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:25:06,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:25:06,424 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:25:06,426 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:25:06,821 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 08:25:06,822 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:25:06,860 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:25:06,860 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:25:06,861 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:06 BoogieIcfgContainer [2024-10-11 08:25:06,861 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:25:06,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:25:06,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:25:06,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:25:06,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:25:05" (1/3) ... [2024-10-11 08:25:06,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3106d260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:06, skipping insertion in model container [2024-10-11 08:25:06,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:06" (2/3) ... [2024-10-11 08:25:06,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3106d260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:06, skipping insertion in model container [2024-10-11 08:25:06,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:06" (3/3) ... [2024-10-11 08:25:06,875 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-11 08:25:06,890 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:25:06,891 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:25:06,966 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:25:06,975 INFO L333 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, 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;@690ae1ba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:25:06,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:25:06,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:25:06,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:25:06,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:06,996 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:06,997 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2066110218, now seen corresponding path program 1 times [2024-10-11 08:25:07,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:07,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582651822] [2024-10-11 08:25:07,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:07,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:07,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:07,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:25:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:07,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:25:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:25:07,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 08:25:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 08:25:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 08:25:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 08:25:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 08:25:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 08:25:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:25:07,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 08:25:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:25:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:25:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:25:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:25:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 08:25:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:25:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 08:25:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:25:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 08:25:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:25:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 08:25:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:25:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:25:07,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:07,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:07,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:07,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582651822] [2024-10-11 08:25:07,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582651822] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:07,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:07,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:25:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932376806] [2024-10-11 08:25:07,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:07,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:25:07,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:07,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:25:07,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:07,912 INFO L87 Difference]: Start difference. First operand has 96 states, 59 states have (on average 1.423728813559322) internal successors, (84), 60 states have internal predecessors, (84), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:08,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:08,020 INFO L93 Difference]: Finished difference Result 229 states and 420 transitions. [2024-10-11 08:25:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:25:08,023 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-11 08:25:08,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:08,036 INFO L225 Difference]: With dead ends: 229 [2024-10-11 08:25:08,037 INFO L226 Difference]: Without dead ends: 134 [2024-10-11 08:25:08,044 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:08,049 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 112 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:08,053 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 277 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:25:08,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-10-11 08:25:08,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2024-10-11 08:25:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.2666666666666666) internal successors, (95), 76 states have internal predecessors, (95), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-11 08:25:08,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 205 transitions. [2024-10-11 08:25:08,123 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 205 transitions. Word has length 214 [2024-10-11 08:25:08,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:08,124 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 205 transitions. [2024-10-11 08:25:08,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:08,125 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 205 transitions. [2024-10-11 08:25:08,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2024-10-11 08:25:08,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:08,132 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:08,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:25:08,133 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:08,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:08,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2010002360, now seen corresponding path program 1 times [2024-10-11 08:25:08,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:08,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86543462] [2024-10-11 08:25:08,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:08,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:08,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:08,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:08,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:08,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:25:08,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:08,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:08,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:08,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:25:08,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:25:08,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 08:25:08,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 08:25:08,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 08:25:08,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 08:25:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 08:25:08,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 08:25:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:25:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 08:25:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:25:08,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:25:08,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:25:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:25:08,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 08:25:08,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:25:08,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 08:25:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:25:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 08:25:08,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:25:08,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 08:25:08,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:25:08,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:25:08,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:08,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:08,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86543462] [2024-10-11 08:25:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86543462] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:08,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:08,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:25:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470260762] [2024-10-11 08:25:08,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:08,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:25:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:08,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:25:08,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:08,558 INFO L87 Difference]: Start difference. First operand 133 states and 205 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:08,613 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-10-11 08:25:08,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:25:08,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 214 [2024-10-11 08:25:08,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:08,622 INFO L225 Difference]: With dead ends: 230 [2024-10-11 08:25:08,624 INFO L226 Difference]: Without dead ends: 133 [2024-10-11 08:25:08,625 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:08,627 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:08,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:25:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-11 08:25:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-11 08:25:08,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 76 states have internal predecessors, (94), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-11 08:25:08,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 204 transitions. [2024-10-11 08:25:08,660 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 204 transitions. Word has length 214 [2024-10-11 08:25:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:08,661 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 204 transitions. [2024-10-11 08:25:08,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 204 transitions. [2024-10-11 08:25:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:25:08,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:08,669 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:08,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:25:08,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:08,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1119309140, now seen corresponding path program 1 times [2024-10-11 08:25:08,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:08,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690897593] [2024-10-11 08:25:08,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:08,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:09,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:09,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:09,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:09,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:09,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:25:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:09,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:25:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:25:09,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 08:25:09,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 08:25:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 08:25:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 08:25:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 08:25:09,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 08:25:09,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:25:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 08:25:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:25:09,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:25:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:25:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:25:09,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 08:25:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:25:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 08:25:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:25:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 08:25:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:25:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 08:25:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:25:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:25:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:09,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690897593] [2024-10-11 08:25:09,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690897593] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:09,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:09,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:25:09,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849666641] [2024-10-11 08:25:09,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:09,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:25:09,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:09,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:25:09,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:25:09,267 INFO L87 Difference]: Start difference. First operand 133 states and 204 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:09,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:09,539 INFO L93 Difference]: Finished difference Result 341 states and 516 transitions. [2024-10-11 08:25:09,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:25:09,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-11 08:25:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:09,545 INFO L225 Difference]: With dead ends: 341 [2024-10-11 08:25:09,545 INFO L226 Difference]: Without dead ends: 244 [2024-10-11 08:25:09,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:25:09,547 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 123 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:09,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 434 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:25:09,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-10-11 08:25:09,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 228. [2024-10-11 08:25:09,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 134 states have (on average 1.2761194029850746) internal successors, (171), 135 states have internal predecessors, (171), 89 states have call successors, (89), 4 states have call predecessors, (89), 4 states have return successors, (89), 88 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-11 08:25:09,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 349 transitions. [2024-10-11 08:25:09,606 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 349 transitions. Word has length 215 [2024-10-11 08:25:09,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:09,607 INFO L471 AbstractCegarLoop]: Abstraction has 228 states and 349 transitions. [2024-10-11 08:25:09,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:09,608 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 349 transitions. [2024-10-11 08:25:09,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:25:09,611 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:09,611 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:09,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:25:09,611 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:09,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:09,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1181513450, now seen corresponding path program 1 times [2024-10-11 08:25:09,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:09,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544349806] [2024-10-11 08:25:09,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:09,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:09,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:09,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:09,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:09,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:25:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:25:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:25:09,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 08:25:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 08:25:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 08:25:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 08:25:09,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 08:25:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 08:25:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:25:09,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 08:25:09,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:25:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:25:09,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:25:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:25:09,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 08:25:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:25:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 08:25:09,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:25:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 08:25:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:25:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 08:25:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:25:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:25:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:09,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:09,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:09,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544349806] [2024-10-11 08:25:09,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544349806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:09,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:09,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:25:09,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134125451] [2024-10-11 08:25:09,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:09,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:25:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:09,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:25:09,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:25:09,967 INFO L87 Difference]: Start difference. First operand 228 states and 349 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:10,243 INFO L93 Difference]: Finished difference Result 674 states and 1022 transitions. [2024-10-11 08:25:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:25:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-11 08:25:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:10,252 INFO L225 Difference]: With dead ends: 674 [2024-10-11 08:25:10,252 INFO L226 Difference]: Without dead ends: 482 [2024-10-11 08:25:10,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:25:10,258 INFO L432 NwaCegarLoop]: 277 mSDtfsCounter, 184 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:10,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 463 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:25:10,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-10-11 08:25:10,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 380. [2024-10-11 08:25:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 234 states have (on average 1.2820512820512822) internal successors, (300), 238 states have internal predecessors, (300), 137 states have call successors, (137), 8 states have call predecessors, (137), 8 states have return successors, (137), 133 states have call predecessors, (137), 137 states have call successors, (137) [2024-10-11 08:25:10,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 574 transitions. [2024-10-11 08:25:10,322 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 574 transitions. Word has length 215 [2024-10-11 08:25:10,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:10,323 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 574 transitions. [2024-10-11 08:25:10,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:10,324 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 574 transitions. [2024-10-11 08:25:10,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:25:10,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:10,326 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:10,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 08:25:10,327 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:10,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:10,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1439678888, now seen corresponding path program 1 times [2024-10-11 08:25:10,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:10,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217109941] [2024-10-11 08:25:10,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:10,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:25:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:25:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 08:25:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:25:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 08:25:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 08:25:10,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 08:25:10,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 08:25:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:25:10,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:25:10,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 08:25:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 08:25:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 08:25:10,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 08:25:10,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 08:25:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 08:25:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 08:25:10,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 08:25:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 08:25:10,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 08:25:10,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 08:25:10,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 08:25:10,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 08:25:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-11 08:25:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 08:25:10,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-11 08:25:10,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 08:25:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-11 08:25:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-10-11 08:25:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-10-11 08:25:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 08:25:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 08:25:10,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 08:25:10,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 08:25:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:10,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:10,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217109941] [2024-10-11 08:25:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217109941] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:25:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564752739] [2024-10-11 08:25:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:25:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:10,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:25:10,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:25:10,802 INFO L87 Difference]: Start difference. First operand 380 states and 574 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:11,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:11,089 INFO L93 Difference]: Finished difference Result 590 states and 872 transitions. [2024-10-11 08:25:11,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:25:11,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-11 08:25:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:11,095 INFO L225 Difference]: With dead ends: 590 [2024-10-11 08:25:11,095 INFO L226 Difference]: Without dead ends: 450 [2024-10-11 08:25:11,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:25:11,098 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 101 mSDsluCounter, 392 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:11,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 541 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:25:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2024-10-11 08:25:11,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 365. [2024-10-11 08:25:11,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 226 states have (on average 1.2787610619469028) internal successors, (289), 229 states have internal predecessors, (289), 130 states have call successors, (130), 8 states have call predecessors, (130), 8 states have return successors, (130), 127 states have call predecessors, (130), 130 states have call successors, (130) [2024-10-11 08:25:11,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 549 transitions. [2024-10-11 08:25:11,150 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 549 transitions. Word has length 215 [2024-10-11 08:25:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:11,150 INFO L471 AbstractCegarLoop]: Abstraction has 365 states and 549 transitions. [2024-10-11 08:25:11,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:11,151 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 549 transitions. [2024-10-11 08:25:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:25:11,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:11,154 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:11,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:25:11,154 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:11,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:11,155 INFO L85 PathProgramCache]: Analyzing trace with hash 630332262, now seen corresponding path program 1 times [2024-10-11 08:25:11,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:11,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903963190] [2024-10-11 08:25:11,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:11,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:11,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:25:11,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [575207221] [2024-10-11 08:25:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:25:11,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:25:11,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:25:11,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:25:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:11,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 08:25:11,498 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:12,389 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:25:12,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:12,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903963190] [2024-10-11 08:25:12,389 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:25:12,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575207221] [2024-10-11 08:25:12,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575207221] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:12,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:12,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 08:25:12,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767910433] [2024-10-11 08:25:12,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:12,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 08:25:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:12,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 08:25:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 08:25:12,392 INFO L87 Difference]: Start difference. First operand 365 states and 549 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:13,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:13,300 INFO L93 Difference]: Finished difference Result 1663 states and 2482 transitions. [2024-10-11 08:25:13,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 08:25:13,301 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 215 [2024-10-11 08:25:13,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:13,311 INFO L225 Difference]: With dead ends: 1663 [2024-10-11 08:25:13,311 INFO L226 Difference]: Without dead ends: 1334 [2024-10-11 08:25:13,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-10-11 08:25:13,315 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 394 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:13,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [394 Valid, 790 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:25:13,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2024-10-11 08:25:13,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 743. [2024-10-11 08:25:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 743 states, 479 states have (on average 1.2985386221294364) internal successors, (622), 485 states have internal predecessors, (622), 247 states have call successors, (247), 16 states have call predecessors, (247), 16 states have return successors, (247), 241 states have call predecessors, (247), 247 states have call successors, (247) [2024-10-11 08:25:13,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 1116 transitions. [2024-10-11 08:25:13,463 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 1116 transitions. Word has length 215 [2024-10-11 08:25:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:13,465 INFO L471 AbstractCegarLoop]: Abstraction has 743 states and 1116 transitions. [2024-10-11 08:25:13,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 1116 transitions. [2024-10-11 08:25:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:25:13,468 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:13,468 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:13,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:25:13,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:25:13,671 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:13,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:13,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1023359272, now seen corresponding path program 1 times [2024-10-11 08:25:13,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:13,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245664939] [2024-10-11 08:25:13,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:13,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:25:13,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1318158419] [2024-10-11 08:25:13,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:13,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:25:13,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:25:13,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:25:13,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:25:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:13,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 08:25:13,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:14,184 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 1866 trivial. 0 not checked. [2024-10-11 08:25:14,185 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:25:14,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:25:14,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245664939] [2024-10-11 08:25:14,185 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 08:25:14,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318158419] [2024-10-11 08:25:14,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318158419] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:14,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:14,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 08:25:14,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247037798] [2024-10-11 08:25:14,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:14,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:25:14,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:25:14,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:25:14,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:25:14,188 INFO L87 Difference]: Start difference. First operand 743 states and 1116 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:25:15,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:15,226 INFO L93 Difference]: Finished difference Result 2100 states and 3096 transitions. [2024-10-11 08:25:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 08:25:15,227 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-10-11 08:25:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:15,236 INFO L225 Difference]: With dead ends: 2100 [2024-10-11 08:25:15,237 INFO L226 Difference]: Without dead ends: 1393 [2024-10-11 08:25:15,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=295, Unknown=0, NotChecked=0, Total=420 [2024-10-11 08:25:15,240 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 303 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 679 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:15,241 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 432 Invalid, 772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 679 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 08:25:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-11 08:25:15,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 763. [2024-10-11 08:25:15,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 763 states, 498 states have (on average 1.2951807228915662) internal successors, (645), 504 states have internal predecessors, (645), 244 states have call successors, (244), 20 states have call predecessors, (244), 20 states have return successors, (244), 238 states have call predecessors, (244), 244 states have call successors, (244) [2024-10-11 08:25:15,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 1133 transitions. [2024-10-11 08:25:15,371 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 1133 transitions. Word has length 215 [2024-10-11 08:25:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:15,372 INFO L471 AbstractCegarLoop]: Abstraction has 763 states and 1133 transitions. [2024-10-11 08:25:15,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (34), 3 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:25:15,373 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 1133 transitions. [2024-10-11 08:25:15,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 08:25:15,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:15,375 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:15,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 08:25:15,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:25:15,576 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:15,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:15,577 INFO L85 PathProgramCache]: Analyzing trace with hash -665584470, now seen corresponding path program 1 times [2024-10-11 08:25:15,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:25:15,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703714050] [2024-10-11 08:25:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:25:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:25:15,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [113833385] [2024-10-11 08:25:15,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:15,675 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:25:15,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:25:15,677 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:25:15,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:25:15,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:25:15,833 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:25:15,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:25:16,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:25:16,057 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:25:16,058 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:25:16,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:25:16,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:25:16,264 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:16,413 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:25:16,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:25:16 BoogieIcfgContainer [2024-10-11 08:25:16,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:25:16,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:25:16,416 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:25:16,418 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:25:16,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:06" (3/4) ... [2024-10-11 08:25:16,420 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:25:16,421 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:25:16,422 INFO L158 Benchmark]: Toolchain (without parser) took 10765.77ms. Allocated memory was 178.3MB in the beginning and 299.9MB in the end (delta: 121.6MB). Free memory was 147.2MB in the beginning and 192.1MB in the end (delta: -44.9MB). Peak memory consumption was 77.9MB. Max. memory is 16.1GB. [2024-10-11 08:25:16,422 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:25:16,422 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.27ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 130.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:25:16,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.85ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 126.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:25:16,422 INFO L158 Benchmark]: Boogie Preprocessor took 78.77ms. Allocated memory is still 178.3MB. Free memory was 126.8MB in the beginning and 122.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:25:16,422 INFO L158 Benchmark]: RCFGBuilder took 655.37ms. Allocated memory is still 178.3MB. Free memory was 122.6MB in the beginning and 93.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 08:25:16,423 INFO L158 Benchmark]: TraceAbstraction took 9548.99ms. Allocated memory was 178.3MB in the beginning and 299.9MB in the end (delta: 121.6MB). Free memory was 92.6MB in the beginning and 192.1MB in the end (delta: -99.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-10-11 08:25:16,423 INFO L158 Benchmark]: Witness Printer took 4.98ms. Allocated memory is still 299.9MB. Free memory is still 192.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:25:16,424 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.17ms. Allocated memory is still 178.3MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.27ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 130.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.85ms. Allocated memory is still 178.3MB. Free memory was 130.4MB in the beginning and 126.8MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.77ms. Allocated memory is still 178.3MB. Free memory was 126.8MB in the beginning and 122.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 655.37ms. Allocated memory is still 178.3MB. Free memory was 122.6MB in the beginning and 93.2MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 9548.99ms. Allocated memory was 178.3MB in the beginning and 299.9MB in the end (delta: 121.6MB). Free memory was 92.6MB in the beginning and 192.1MB in the end (delta: -99.5MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Witness Printer took 4.98ms. Allocated memory is still 299.9MB. Free memory is still 192.1MB. There was no memory consumed. Max. memory is 16.1GB. * 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 187, overapproximation of someBinaryDOUBLEComparisonOperation at line 187, overapproximation of someUnaryFLOAToperation at line 112, overapproximation of someBinaryArithmeticFLOAToperation at line 112. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] float var_1_27 = 16.625; [L45] signed long int var_1_28 = -100000; [L46] signed long int var_1_29 = -128; [L47] signed char var_1_30 = -25; [L48] unsigned char var_1_31 = 0; [L49] unsigned char var_1_32 = 0; [L50] unsigned short int var_1_33 = 128; [L51] signed long int var_1_34 = 128; [L52] unsigned short int var_1_35 = 4; [L53] unsigned short int var_1_36 = 4; [L54] double var_1_37 = 99.75; [L55] unsigned char var_1_38 = 0; [L56] signed long int var_1_39 = 10; [L57] signed short int last_1_var_1_12 = 2; [L58] signed long int last_1_var_1_13 = -256; [L59] double last_1_var_1_14 = 127.75; [L60] unsigned char last_1_var_1_21 = 0; [L191] isInitial = 1 [L192] FCALL initially() [L193] COND TRUE 1 [L194] CALL updateLastVariables() [L181] last_1_var_1_12 = var_1_12 [L182] last_1_var_1_13 = var_1_13 [L183] last_1_var_1_14 = var_1_14 [L184] last_1_var_1_21 = var_1_21 [L194] RET updateLastVariables() [L195] CALL updateVariables() [L125] var_1_3 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L126] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L127] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L127] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L128] var_1_4 = __VERIFIER_nondet_uchar() [L129] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L129] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L130] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L130] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L131] var_1_5 = __VERIFIER_nondet_uchar() [L132] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L132] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L133] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L133] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L134] var_1_9 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L135] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L136] var_1_11 = __VERIFIER_nondet_ushort() [L137] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L137] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L138] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L139] var_1_15 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L140] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L141] var_1_17 = __VERIFIER_nondet_float() [L142] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L142] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L143] var_1_18 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L144] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L145] var_1_19 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L146] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L147] var_1_20 = __VERIFIER_nondet_float() [L148] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L149] var_1_22 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L150] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L151] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_24 = __VERIFIER_nondet_short() [L153] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L154] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L154] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L155] var_1_25 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L156] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L157] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L157] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_27=133/8, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L158] var_1_27 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L159] RET assume_abort_if_not((var_1_27 >= -922337.2036854765600e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 9223372.036854765600e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=-128, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L160] var_1_29 = __VERIFIER_nondet_long() [L161] CALL assume_abort_if_not(var_1_29 >= -2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L161] RET assume_abort_if_not(var_1_29 >= -2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L162] CALL assume_abort_if_not(var_1_29 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L162] RET assume_abort_if_not(var_1_29 <= 2147483646) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=0, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L163] var_1_32 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_32 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not(var_1_32 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L165] CALL assume_abort_if_not(var_1_32 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L165] RET assume_abort_if_not(var_1_32 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=128, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L166] var_1_34 = __VERIFIER_nondet_long() [L167] CALL assume_abort_if_not(var_1_34 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_34 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L168] CALL assume_abort_if_not(var_1_34 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L168] RET assume_abort_if_not(var_1_34 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=4, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L169] var_1_35 = __VERIFIER_nondet_ushort() [L170] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L171] CALL assume_abort_if_not(var_1_35 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L171] RET assume_abort_if_not(var_1_35 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=4, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L172] var_1_36 = __VERIFIER_nondet_ushort() [L173] CALL assume_abort_if_not(var_1_36 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_36 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L174] CALL assume_abort_if_not(var_1_36 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L174] RET assume_abort_if_not(var_1_36 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=10, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L175] var_1_39 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_39 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L176] RET assume_abort_if_not(var_1_39 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L178] CALL assume_abort_if_not(var_1_39 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_39 != 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_29=0, var_1_30=-25, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L195] RET updateVariables() [L196] CALL step() [L64] var_1_26 = var_1_27 [L65] var_1_28 = var_1_29 [L66] var_1_30 = 0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L67] COND FALSE !(var_1_28 < var_1_29) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L70] EXPR var_1_28 ^ var_1_29 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=399/4, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L70] COND FALSE !((var_1_28 ^ var_1_29) >= var_1_34) [L77] COND TRUE var_1_31 || var_1_32 [L78] var_1_37 = ((((var_1_27) < 0 ) ? -(var_1_27) : (var_1_27))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L80] COND FALSE !(var_1_34 <= (var_1_29 % var_1_39)) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L83] COND FALSE !(\read(last_1_var_1_21)) [L86] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L88] COND FALSE !(var_1_18 > var_1_9) [L91] var_1_23 = (last_1_var_1_13 + 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L93] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L94] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=25] [L95] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L96] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L103] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L104] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L107] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L107] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L108] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L112] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L113] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L114] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L117] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L118] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L196] RET step() [L197] CALL, EXPR property() [L187] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L187-L188] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L197] RET, EXPR property() [L197] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=4, var_1_15=4, var_1_16=5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_27=2, var_1_28=0, var_1_29=0, var_1_30=0, var_1_31=0, var_1_32=1, var_1_33=128, var_1_34=1, var_1_35=0, var_1_36=0, var_1_37=3, var_1_38=0, var_1_39=2, var_1_3=1, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.3s, OverallIterations: 8, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1269 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1217 mSDsluCounter, 3216 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1928 mSDsCounter, 364 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1412 IncrementalHoareTripleChecker+Invalid, 1776 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 364 mSolverCounterUnsat, 1288 mSDtfsCounter, 1412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 812 GetRequests, 773 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=763occurred in iteration=7, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 7 MinimizatonAttempts, 1425 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 2363 NumberOfCodeBlocks, 2363 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 3650 SizeOfPredicates, 7 NumberOfNonLiveVariables, 992 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 15708/15708 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 [2024-10-11 08:25:16,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:25:18,694 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:25:18,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:25:18,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:25:18,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:25:18,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:25:18,812 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:25:18,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:25:18,813 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:25:18,813 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:25:18,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:25:18,815 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:25:18,816 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:25:18,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:25:18,820 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:25:18,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:25:18,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:25:18,821 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:25:18,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:25:18,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:25:18,822 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:25:18,823 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:25:18,823 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:25:18,823 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:25:18,824 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:25:18,824 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:25:18,824 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:25:18,824 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:25:18,825 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:25:18,825 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:25:18,825 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:25:18,826 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:25:18,826 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:25:18,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:25:18,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:25:18,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:25:18,829 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:25:18,829 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:25:18,830 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:25:18,830 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:25:18,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:25:18,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:25:18,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:25:18,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:25:18,831 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:25:18,831 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-clean/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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 36caaf551db5482f04140b8d335e706a9dbab961e11e8444b233de0d9b0de1a7 [2024-10-11 08:25:19,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:25:19,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:25:19,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:25:19,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:25:19,209 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:25:19,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-11 08:25:20,790 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:25:21,012 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:25:21,014 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-11 08:25:21,026 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e55cc797b/852db41234074d8bb159779baa65891d/FLAG4ca88bddd [2024-10-11 08:25:21,366 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e55cc797b/852db41234074d8bb159779baa65891d [2024-10-11 08:25:21,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:25:21,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:25:21,371 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:25:21,371 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:25:21,376 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:25:21,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,378 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed47e84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21, skipping insertion in model container [2024-10-11 08:25:21,378 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,411 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:25:21,616 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i[915,928] [2024-10-11 08:25:21,715 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:25:21,740 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:25:21,753 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-25_file-35.i[915,928] [2024-10-11 08:25:21,806 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:25:21,832 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:25:21,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21 WrapperNode [2024-10-11 08:25:21,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:25:21,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:25:21,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:25:21,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:25:21,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,862 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,904 INFO L138 Inliner]: procedures = 27, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-10-11 08:25:21,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:25:21,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:25:21,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:25:21,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:25:21,917 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,918 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,923 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,944 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]. [2024-10-11 08:25:21,945 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,945 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,958 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,975 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:25:21,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:25:21,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:25:21,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:25:21,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (1/1) ... [2024-10-11 08:25:21,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:25:22,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:25:22,024 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:25:22,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:25:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:25:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:25:22,073 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:25:22,074 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:25:22,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:25:22,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:25:22,195 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:25:22,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:25:24,663 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 08:25:24,664 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:25:24,720 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:25:24,721 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:25:24,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:24 BoogieIcfgContainer [2024-10-11 08:25:24,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:25:24,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:25:24,723 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:25:24,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:25:24,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:25:21" (1/3) ... [2024-10-11 08:25:24,729 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d3db0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:24, skipping insertion in model container [2024-10-11 08:25:24,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:25:21" (2/3) ... [2024-10-11 08:25:24,730 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55d3db0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:25:24, skipping insertion in model container [2024-10-11 08:25:24,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:25:24" (3/3) ... [2024-10-11 08:25:24,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-25_file-35.i [2024-10-11 08:25:24,748 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:25:24,749 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:25:24,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:25:24,834 INFO L333 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, 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;@11c985ca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:25:24,834 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:25:24,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:25:24,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:25:24,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:24,856 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:24,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:24,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:24,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1197699393, now seen corresponding path program 1 times [2024-10-11 08:25:24,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:25:24,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056070690] [2024-10-11 08:25:24,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:24,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:24,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:25:24,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:25:24,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:25:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:25,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:25:25,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:25,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 986 proven. 0 refuted. 0 times theorem prover too weak. 1258 trivial. 0 not checked. [2024-10-11 08:25:25,443 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:25:25,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:25:25,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056070690] [2024-10-11 08:25:25,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056070690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:25,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:25,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:25:25,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286621646] [2024-10-11 08:25:25,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:25,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:25:25,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:25:25,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:25:25,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:25:25,482 INFO L87 Difference]: Start difference. First operand has 85 states, 48 states have (on average 1.3958333333333333) internal successors, (67), 49 states have internal predecessors, (67), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:25:26,712 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:25:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:26,713 INFO L93 Difference]: Finished difference Result 167 states and 302 transitions. [2024-10-11 08:25:26,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:25:26,732 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 210 [2024-10-11 08:25:26,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:26,739 INFO L225 Difference]: With dead ends: 167 [2024-10-11 08:25:26,739 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 08:25:26,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:25:26,746 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:26,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 08:25:26,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 08:25:26,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 08:25:26,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 47 states have (on average 1.3191489361702127) internal successors, (62), 47 states have internal predecessors, (62), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-11 08:25:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-11 08:25:26,792 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 210 [2024-10-11 08:25:26,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:26,793 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-11 08:25:26,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-10-11 08:25:26,794 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-11 08:25:26,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:25:26,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:26,799 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:26,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 08:25:27,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:27,004 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:27,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:27,005 INFO L85 PathProgramCache]: Analyzing trace with hash -42975753, now seen corresponding path program 1 times [2024-10-11 08:25:27,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:25:27,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1518649249] [2024-10-11 08:25:27,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:27,006 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:27,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:25:27,010 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:25:27,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:25:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:27,399 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:25:27,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:27,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:25:27,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:25:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1518649249] [2024-10-11 08:25:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1518649249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:25:27,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75893966] [2024-10-11 08:25:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:27,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:25:27,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:25:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:25:27,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:27,497 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:28,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:25:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:28,912 INFO L93 Difference]: Finished difference Result 205 states and 319 transitions. [2024-10-11 08:25:28,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:25:28,913 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-11 08:25:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:28,918 INFO L225 Difference]: With dead ends: 205 [2024-10-11 08:25:28,919 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 08:25:28,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:25:28,923 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 95 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:28,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 265 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-11 08:25:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 08:25:28,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2024-10-11 08:25:28,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 64 states have (on average 1.21875) internal successors, (78), 65 states have internal predecessors, (78), 55 states have call successors, (55), 2 states have call predecessors, (55), 2 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2024-10-11 08:25:28,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 188 transitions. [2024-10-11 08:25:28,957 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 188 transitions. Word has length 210 [2024-10-11 08:25:28,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:28,958 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 188 transitions. [2024-10-11 08:25:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 188 transitions. [2024-10-11 08:25:28,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:25:28,962 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:28,962 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:28,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:25:29,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:29,167 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:29,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:29,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2037120459, now seen corresponding path program 1 times [2024-10-11 08:25:29,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:25:29,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287111485] [2024-10-11 08:25:29,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:29,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:29,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:25:29,172 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:25:29,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:25:29,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:29,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 08:25:29,575 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:30,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:30,249 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:25:30,249 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:25:30,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287111485] [2024-10-11 08:25:30,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287111485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:30,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:30,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:25:30,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591351183] [2024-10-11 08:25:30,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:30,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:25:30,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:25:30,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:25:30,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:25:30,253 INFO L87 Difference]: Start difference. First operand 122 states and 188 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:32,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:25:32,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:32,856 INFO L93 Difference]: Finished difference Result 312 states and 476 transitions. [2024-10-11 08:25:32,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:25:32,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-11 08:25:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:32,878 INFO L225 Difference]: With dead ends: 312 [2024-10-11 08:25:32,878 INFO L226 Difference]: Without dead ends: 226 [2024-10-11 08:25:32,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:25:32,880 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 114 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:32,881 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 388 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 08:25:32,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2024-10-11 08:25:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 206. [2024-10-11 08:25:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 112 states have (on average 1.2410714285714286) internal successors, (139), 113 states have internal predecessors, (139), 89 states have call successors, (89), 4 states have call predecessors, (89), 4 states have return successors, (89), 88 states have call predecessors, (89), 89 states have call successors, (89) [2024-10-11 08:25:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2024-10-11 08:25:32,923 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 210 [2024-10-11 08:25:32,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:32,924 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2024-10-11 08:25:32,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:32,925 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2024-10-11 08:25:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-10-11 08:25:32,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:32,928 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:32,947 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 08:25:33,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:33,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:33,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1246729587, now seen corresponding path program 1 times [2024-10-11 08:25:33,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:25:33,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [486528358] [2024-10-11 08:25:33,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:33,132 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:33,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:25:33,135 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:25:33,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 08:25:33,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:33,524 INFO L255 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 08:25:33,531 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:25:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-10-11 08:25:34,234 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:25:34,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:25:34,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [486528358] [2024-10-11 08:25:34,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [486528358] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:25:34,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:25:34,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:25:34,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894820596] [2024-10-11 08:25:34,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:25:34,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 08:25:34,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:25:34,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 08:25:34,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 08:25:34,238 INFO L87 Difference]: Start difference. First operand 206 states and 317 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:35,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:25:37,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:25:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:25:37,435 INFO L93 Difference]: Finished difference Result 568 states and 868 transitions. [2024-10-11 08:25:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 08:25:37,459 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) Word has length 210 [2024-10-11 08:25:37,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:25:37,466 INFO L225 Difference]: With dead ends: 568 [2024-10-11 08:25:37,466 INFO L226 Difference]: Without dead ends: 398 [2024-10-11 08:25:37,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 08:25:37,485 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 86 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:25:37,485 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 444 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-10-11 08:25:37,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-10-11 08:25:37,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 374. [2024-10-11 08:25:37,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 208 states have (on average 1.25) internal successors, (260), 209 states have internal predecessors, (260), 157 states have call successors, (157), 8 states have call predecessors, (157), 8 states have return successors, (157), 156 states have call predecessors, (157), 157 states have call successors, (157) [2024-10-11 08:25:37,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 574 transitions. [2024-10-11 08:25:37,571 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 574 transitions. Word has length 210 [2024-10-11 08:25:37,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:25:37,573 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 574 transitions. [2024-10-11 08:25:37,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-10-11 08:25:37,573 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 574 transitions. [2024-10-11 08:25:37,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-10-11 08:25:37,579 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:25:37,579 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:25:37,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 08:25:37,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:37,780 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:25:37,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:25:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1389907022, now seen corresponding path program 1 times [2024-10-11 08:25:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:25:37,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855009093] [2024-10-11 08:25:37,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:25:37,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:25:37,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:25:37,785 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:25:37,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 08:25:38,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:25:38,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 08:25:38,259 INFO L278 TraceCheckSpWp]: Computing forward predicates...