./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_codestructure_steplocals_file-63.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_codestructure_steplocals_file-63.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 b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:34:54,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:34:54,569 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:34:54,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:34:54,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:34:54,614 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:34:54,616 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:34:54,616 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:34:54,616 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:34:54,619 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:34:54,619 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:34:54,620 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:34:54,620 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:34:54,632 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:34:54,632 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:34:54,632 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:34:54,632 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:34:54,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:34:54,634 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:34:54,634 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:34:54,634 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:34:54,635 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:34:54,635 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:34:54,635 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:34:54,635 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:34:54,635 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:34:54,635 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:34:54,636 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:34:54,636 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:34:54,636 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:34:54,636 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:34:54,636 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:34:54,637 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:34:54,637 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:34:54,637 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:34:54,637 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:34:54,637 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:34:54,638 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:34:54,638 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:34:54,638 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:34:54,638 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:34:54,639 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:34:54,639 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 -> b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 [2024-10-11 07:34:54,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:34:54,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:34:54,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:34:54,908 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:34:54,911 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:34:54,912 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-11 07:34:56,285 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:34:56,517 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:34:56,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-11 07:34:56,528 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d320ddca/cb2042934f0f4bd8a2fcf2ad25aba5fe/FLAGe533c4fc0 [2024-10-11 07:34:56,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/8d320ddca/cb2042934f0f4bd8a2fcf2ad25aba5fe [2024-10-11 07:34:56,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:34:56,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:34:56,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:34:56,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:34:56,890 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:34:56,891 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:34:56" (1/1) ... [2024-10-11 07:34:56,891 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7758648d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:56, skipping insertion in model container [2024-10-11 07:34:56,893 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:34:56" (1/1) ... [2024-10-11 07:34:56,946 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:34:57,114 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_codestructure_steplocals_file-63.i[917,930] [2024-10-11 07:34:57,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:34:57,176 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:34:57,186 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_codestructure_steplocals_file-63.i[917,930] [2024-10-11 07:34:57,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:34:57,230 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:34:57,233 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57 WrapperNode [2024-10-11 07:34:57,233 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:34:57,234 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:34:57,234 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:34:57,235 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:34:57,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,249 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,287 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-10-11 07:34:57,288 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:34:57,289 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:34:57,289 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:34:57,289 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:34:57,303 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,303 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,333 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 07:34:57,333 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,350 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,358 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:34:57,371 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:34:57,371 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:34:57,371 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:34:57,372 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (1/1) ... [2024-10-11 07:34:57,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:34:57,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:34:57,405 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 07:34:57,412 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 07:34:57,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:34:57,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:34:57,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:34:57,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:34:57,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:34:57,452 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:34:57,534 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:34:57,536 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:34:57,891 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 07:34:57,892 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:34:57,923 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:34:57,924 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:34:57,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:57 BoogieIcfgContainer [2024-10-11 07:34:57,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:34:57,926 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:34:57,926 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:34:57,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:34:57,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:34:56" (1/3) ... [2024-10-11 07:34:57,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b67c358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:34:57, skipping insertion in model container [2024-10-11 07:34:57,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:34:57" (2/3) ... [2024-10-11 07:34:57,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b67c358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:34:57, skipping insertion in model container [2024-10-11 07:34:57,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:57" (3/3) ... [2024-10-11 07:34:57,931 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2024-10-11 07:34:57,944 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:34:57,944 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:34:57,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:34:57,998 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;@55d0eb63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:34:57,998 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:34:58,002 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 57 states have (on average 1.368421052631579) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:34:58,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 07:34:58,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:34:58,016 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:58,017 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:34:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:34:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1546095273, now seen corresponding path program 1 times [2024-10-11 07:34:58,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:34:58,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800975232] [2024-10-11 07:34:58,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:34:58,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:34:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:34:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:34:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:34:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:34:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:34:58,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:34:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:34:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:34:58,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:34:58,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:34:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:34:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:34:58,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:34:58,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:34:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:34:58,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:34:58,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:34:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:34:58,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:34:58,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:34:58,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:34:58,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:34:58,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:34:58,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:34:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:34:58,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:34:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:34:58,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:34:58,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:34:58,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 07:34:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 07:34:58,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 07:34:58,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 07:34:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 07:34:58,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 07:34:58,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 07:34:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:34:58,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:34:58,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800975232] [2024-10-11 07:34:58,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800975232] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:34:58,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:34:58,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:34:58,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942731069] [2024-10-11 07:34:58,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:34:58,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:34:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:34:58,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:34:58,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:34:58,570 INFO L87 Difference]: Start difference. First operand has 96 states, 57 states have (on average 1.368421052631579) internal successors, (78), 58 states have internal predecessors, (78), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 07:34:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:34:58,605 INFO L93 Difference]: Finished difference Result 189 states and 334 transitions. [2024-10-11 07:34:58,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:34:58,610 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) Word has length 222 [2024-10-11 07:34:58,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:34:58,619 INFO L225 Difference]: With dead ends: 189 [2024-10-11 07:34:58,619 INFO L226 Difference]: Without dead ends: 94 [2024-10-11 07:34:58,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 110 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 07:34:58,628 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:34:58,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:34:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-11 07:34:58,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-10-11 07:34:58,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:34:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 145 transitions. [2024-10-11 07:34:58,678 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 145 transitions. Word has length 222 [2024-10-11 07:34:58,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:34:58,679 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 145 transitions. [2024-10-11 07:34:58,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 07:34:58,679 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 145 transitions. [2024-10-11 07:34:58,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 07:34:58,682 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:34:58,683 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:58,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:34:58,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:34:58,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:34:58,684 INFO L85 PathProgramCache]: Analyzing trace with hash 31687901, now seen corresponding path program 1 times [2024-10-11 07:34:58,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:34:58,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217218109] [2024-10-11 07:34:58,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:34:58,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:34:58,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:34:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:34:58,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:34:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:34:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:34:58,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:34:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:34:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:34:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:34:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:34:58,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:34:58,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:34:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:34:58,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:34:58,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:34:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:34:58,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:34:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:34:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:34:58,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:34:58,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:34:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:34:58,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:34:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:34:58,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:34:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:34:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:34:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:34:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:34:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 07:34:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 07:34:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 07:34:58,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 07:34:58,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 07:34:58,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 07:34:58,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 07:34:58,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:34:58,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:34:58,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217218109] [2024-10-11 07:34:58,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217218109] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:34:58,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:34:58,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:34:58,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526191414] [2024-10-11 07:34:58,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:34:58,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:34:58,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:34:58,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:34:58,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:34:58,984 INFO L87 Difference]: Start difference. First operand 94 states and 145 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:34:59,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:34:59,096 INFO L93 Difference]: Finished difference Result 232 states and 354 transitions. [2024-10-11 07:34:59,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:34:59,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 07:34:59,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:34:59,103 INFO L225 Difference]: With dead ends: 232 [2024-10-11 07:34:59,103 INFO L226 Difference]: Without dead ends: 139 [2024-10-11 07:34:59,104 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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 07:34:59,105 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 60 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:34:59,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 306 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:34:59,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-11 07:34:59,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2024-10-11 07:34:59,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 88 states have internal predecessors, (113), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 07:34:59,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 205 transitions. [2024-10-11 07:34:59,130 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 205 transitions. Word has length 222 [2024-10-11 07:34:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:34:59,131 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 205 transitions. [2024-10-11 07:34:59,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:34:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 205 transitions. [2024-10-11 07:34:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 07:34:59,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:34:59,135 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:59,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:34:59,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:34:59,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:34:59,136 INFO L85 PathProgramCache]: Analyzing trace with hash 289853339, now seen corresponding path program 1 times [2024-10-11 07:34:59,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:34:59,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461851811] [2024-10-11 07:34:59,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:34:59,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:34:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:34:59,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:34:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:34:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:34:59,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:34:59,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:34:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:34:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:34:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:34:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:34:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:34:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:34:59,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:34:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:34:59,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:34:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:34:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:34:59,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:34:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:34:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:34:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:34:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:34:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:34:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:34:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:34:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:34:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:34:59,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:34:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:34:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 07:34:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 07:34:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 07:34:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 07:34:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 07:34:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 07:34:59,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 07:34:59,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:34:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:34:59,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461851811] [2024-10-11 07:34:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461851811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:34:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:34:59,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:34:59,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886211036] [2024-10-11 07:34:59,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:34:59,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:34:59,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:34:59,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:34:59,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:34:59,343 INFO L87 Difference]: Start difference. First operand 136 states and 205 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:34:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:34:59,409 INFO L93 Difference]: Finished difference Result 285 states and 425 transitions. [2024-10-11 07:34:59,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:34:59,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 07:34:59,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:34:59,412 INFO L225 Difference]: With dead ends: 285 [2024-10-11 07:34:59,412 INFO L226 Difference]: Without dead ends: 150 [2024-10-11 07:34:59,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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 07:34:59,414 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 57 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:34:59,414 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 278 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:34:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-10-11 07:34:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 116. [2024-10-11 07:34:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 77 states have (on average 1.2857142857142858) internal successors, (99), 77 states have internal predecessors, (99), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:34:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2024-10-11 07:34:59,426 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 222 [2024-10-11 07:34:59,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:34:59,427 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2024-10-11 07:34:59,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:34:59,427 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2024-10-11 07:34:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2024-10-11 07:34:59,432 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:34:59,432 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:34:59,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 07:34:59,432 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:34:59,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:34:59,433 INFO L85 PathProgramCache]: Analyzing trace with hash -519493287, now seen corresponding path program 1 times [2024-10-11 07:34:59,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:34:59,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047712063] [2024-10-11 07:34:59,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:34:59,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:34:59,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:34:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:34:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:34:59,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:34:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:34:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:34:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:34:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:34:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:34:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:34:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:34:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:34:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:34:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:34:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:34:59,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:34:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:34:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:34:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:34:59,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:34:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:34:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:34:59,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:34:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:34:59,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:34:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:34:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:34:59,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:34:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:34:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 07:34:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 07:34:59,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 07:34:59,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 07:34:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 07:34:59,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 07:34:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 07:34:59,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:34:59,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:34:59,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:34:59,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047712063] [2024-10-11 07:34:59,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047712063] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:34:59,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:34:59,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 07:34:59,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573107830] [2024-10-11 07:34:59,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:34:59,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 07:34:59,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:34:59,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 07:34:59,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 07:34:59,923 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:00,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:00,107 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-10-11 07:35:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 07:35:00,107 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 222 [2024-10-11 07:35:00,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:00,109 INFO L225 Difference]: With dead ends: 270 [2024-10-11 07:35:00,111 INFO L226 Difference]: Without dead ends: 155 [2024-10-11 07:35:00,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 07:35:00,113 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 33 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:00,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 621 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:35:00,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-10-11 07:35:00,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2024-10-11 07:35:00,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 110 states have (on average 1.3) internal successors, (143), 111 states have internal predecessors, (143), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 07:35:00,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2024-10-11 07:35:00,133 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 222 [2024-10-11 07:35:00,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:00,134 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2024-10-11 07:35:00,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:00,135 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2024-10-11 07:35:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 07:35:00,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:00,138 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:00,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:35:00,138 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:00,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:00,139 INFO L85 PathProgramCache]: Analyzing trace with hash -34645832, now seen corresponding path program 1 times [2024-10-11 07:35:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:35:00,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703578429] [2024-10-11 07:35:00,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:00,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:35:00,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:35:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:35:00,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:35:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:35:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:35:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:35:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:35:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:35:00,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:35:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:35:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:35:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:35:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:35:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:35:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:35:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:35:00,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:35:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:35:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:35:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:35:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:35:00,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:35:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:35:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:35:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:35:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:35:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:35:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:35:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:35:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 07:35:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 07:35:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 07:35:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 07:35:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 07:35:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 07:35:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 07:35:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:00,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:35:00,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:35:00,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703578429] [2024-10-11 07:35:00,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703578429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:00,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:00,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 07:35:00,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591785543] [2024-10-11 07:35:00,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:00,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:35:00,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:35:00,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:35:00,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:35:00,670 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:00,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:00,989 INFO L93 Difference]: Finished difference Result 385 states and 546 transitions. [2024-10-11 07:35:00,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 07:35:00,990 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-11 07:35:00,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:00,997 INFO L225 Difference]: With dead ends: 385 [2024-10-11 07:35:00,997 INFO L226 Difference]: Without dead ends: 234 [2024-10-11 07:35:00,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-11 07:35:00,999 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 81 mSDsluCounter, 644 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:00,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 807 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:35:01,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2024-10-11 07:35:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 196. [2024-10-11 07:35:01,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 154 states have (on average 1.344155844155844) internal successors, (207), 155 states have internal predecessors, (207), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 07:35:01,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 283 transitions. [2024-10-11 07:35:01,029 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 283 transitions. Word has length 223 [2024-10-11 07:35:01,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:01,030 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 283 transitions. [2024-10-11 07:35:01,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:01,030 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 283 transitions. [2024-10-11 07:35:01,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-10-11 07:35:01,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:01,035 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:01,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 07:35:01,036 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:01,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:01,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1151587566, now seen corresponding path program 1 times [2024-10-11 07:35:01,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:35:01,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745490549] [2024-10-11 07:35:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:35:01,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:35:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:35:01,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:35:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:35:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:35:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:35:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:35:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:35:01,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:35:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:35:01,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:35:01,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:35:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:35:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:35:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:35:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:35:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:35:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 07:35:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 07:35:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 07:35:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 07:35:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 07:35:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 07:35:01,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-10-11 07:35:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 07:35:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 07:35:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 07:35:01,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 07:35:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 07:35:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-10-11 07:35:01,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-10-11 07:35:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-10-11 07:35:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-10-11 07:35:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-10-11 07:35:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2024-10-11 07:35:01,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2024-10-11 07:35:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:35:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:35:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745490549] [2024-10-11 07:35:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745490549] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:01,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:35:01,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180893612] [2024-10-11 07:35:01,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:01,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:35:01,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:35:01,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:35:01,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:35:01,201 INFO L87 Difference]: Start difference. First operand 196 states and 283 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:01,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:01,241 INFO L93 Difference]: Finished difference Result 432 states and 620 transitions. [2024-10-11 07:35:01,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:35:01,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 223 [2024-10-11 07:35:01,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:01,244 INFO L225 Difference]: With dead ends: 432 [2024-10-11 07:35:01,244 INFO L226 Difference]: Without dead ends: 237 [2024-10-11 07:35:01,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 74 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 07:35:01,245 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 30 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:01,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 295 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:35:01,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-10-11 07:35:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 218. [2024-10-11 07:35:01,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 176 states have (on average 1.3465909090909092) internal successors, (237), 177 states have internal predecessors, (237), 38 states have call successors, (38), 3 states have call predecessors, (38), 3 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 07:35:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 313 transitions. [2024-10-11 07:35:01,275 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 313 transitions. Word has length 223 [2024-10-11 07:35:01,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:01,276 INFO L471 AbstractCegarLoop]: Abstraction has 218 states and 313 transitions. [2024-10-11 07:35:01,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 313 transitions. [2024-10-11 07:35:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2024-10-11 07:35:01,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:01,279 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 07:35:01,279 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:01,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1409506018, now seen corresponding path program 1 times [2024-10-11 07:35:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:35:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906835680] [2024-10-11 07:35:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:35:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:35:01,397 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:35:01,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:35:01,534 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:35:01,534 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:35:01,535 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:35:01,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 07:35:01,539 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:35:01,627 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:35:01,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:35:01 BoogieIcfgContainer [2024-10-11 07:35:01,629 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:35:01,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:35:01,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:35:01,630 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:35:01,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:34:57" (3/4) ... [2024-10-11 07:35:01,632 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:35:01,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:35:01,633 INFO L158 Benchmark]: Toolchain (without parser) took 4753.22ms. Allocated memory was 134.2MB in the beginning and 274.7MB in the end (delta: 140.5MB). Free memory was 66.0MB in the beginning and 153.0MB in the end (delta: -87.1MB). Peak memory consumption was 55.8MB. Max. memory is 16.1GB. [2024-10-11 07:35:01,633 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 134.2MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:35:01,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 348.25ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 65.8MB in the beginning and 144.1MB in the end (delta: -78.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2024-10-11 07:35:01,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.84ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 140.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:35:01,634 INFO L158 Benchmark]: Boogie Preprocessor took 81.92ms. Allocated memory is still 184.5MB. Free memory was 140.7MB in the beginning and 136.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:35:01,634 INFO L158 Benchmark]: RCFGBuilder took 552.91ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 108.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 07:35:01,634 INFO L158 Benchmark]: TraceAbstraction took 3703.45ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 108.0MB in the beginning and 153.0MB in the end (delta: -45.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2024-10-11 07:35:01,635 INFO L158 Benchmark]: Witness Printer took 3.10ms. Allocated memory is still 274.7MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:35:01,636 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.11ms. Allocated memory is still 134.2MB. Free memory is still 99.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 348.25ms. Allocated memory was 134.2MB in the beginning and 184.5MB in the end (delta: 50.3MB). Free memory was 65.8MB in the beginning and 144.1MB in the end (delta: -78.3MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.84ms. Allocated memory is still 184.5MB. Free memory was 144.1MB in the beginning and 140.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.92ms. Allocated memory is still 184.5MB. Free memory was 140.7MB in the beginning and 136.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 552.91ms. Allocated memory is still 184.5MB. Free memory was 136.5MB in the beginning and 108.4MB in the end (delta: 28.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3703.45ms. Allocated memory was 184.5MB in the beginning and 274.7MB in the end (delta: 90.2MB). Free memory was 108.0MB in the beginning and 153.0MB in the end (delta: -45.0MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Witness Printer took 3.10ms. Allocated memory is still 274.7MB. Free memory is still 153.0MB. 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 someBinaryDOUBLEComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 160. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned long int var_1_2 = 50; [L24] unsigned long int var_1_3 = 8; [L25] signed long int var_1_4 = 25; [L26] signed long int var_1_5 = -100; [L27] signed long int var_1_6 = 8; [L28] unsigned char var_1_7 = 0; [L29] signed long int var_1_8 = 128; [L30] signed long int var_1_9 = 2; [L31] signed long int var_1_10 = 128; [L32] unsigned short int var_1_11 = 500; [L33] unsigned short int var_1_12 = 128; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_15 = 1; [L36] unsigned char var_1_16 = 8; [L37] double var_1_17 = 7.5; [L38] double var_1_18 = 31.125; [L39] double var_1_19 = 10.5; [L40] double var_1_20 = 0.0; [L41] double var_1_21 = 16.75; [L42] double var_1_22 = 2.5; [L43] double var_1_23 = 64.5; [L44] signed long int var_1_24 = 10; [L45] signed long int var_1_25 = -64; [L46] signed char var_1_26 = 16; [L47] signed char var_1_27 = 4; [L48] signed char var_1_28 = -10; [L49] float var_1_29 = 63.794; [L50] unsigned short int var_1_30 = 1; [L51] signed long int var_1_31 = -2; [L52] unsigned char var_1_32 = 64; [L164] isInitial = 1 [L165] FCALL initially() [L166] COND TRUE 1 [L167] FCALL updateLastVariables() [L168] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_ulong() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L101] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=8, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L102] var_1_3 = __VERIFIER_nondet_ulong() [L103] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L103] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L104] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=25, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L105] var_1_4 = __VERIFIER_nondet_long() [L106] CALL assume_abort_if_not(var_1_4 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L106] RET assume_abort_if_not(var_1_4 >= -1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] CALL assume_abort_if_not(var_1_4 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L107] RET assume_abort_if_not(var_1_4 <= 1073741823) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=-100, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L108] var_1_5 = __VERIFIER_nondet_long() [L109] CALL assume_abort_if_not(var_1_5 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L109] RET assume_abort_if_not(var_1_5 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L110] CALL assume_abort_if_not(var_1_5 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L110] RET assume_abort_if_not(var_1_5 <= 536870912) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=8, var_1_7=0, var_1_8=128, var_1_9=2] [L111] var_1_6 = __VERIFIER_nondet_long() [L112] CALL assume_abort_if_not(var_1_6 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L112] RET assume_abort_if_not(var_1_6 >= -536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L113] CALL assume_abort_if_not(var_1_6 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L113] RET assume_abort_if_not(var_1_6 <= 536870911) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L114] var_1_7 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_8=128, var_1_9=2] [L115] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_8=128, var_1_9=2] [L116] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L116] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=128, var_1_9=2] [L117] var_1_8 = __VERIFIER_nondet_long() [L118] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L118] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L119] CALL assume_abort_if_not(var_1_8 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L119] RET assume_abort_if_not(var_1_8 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=2] [L120] var_1_9 = __VERIFIER_nondet_long() [L121] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L121] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L122] CALL assume_abort_if_not(var_1_9 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L122] RET assume_abort_if_not(var_1_9 <= 2147483646) VAL [isInitial=1, var_1_10=128, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L123] var_1_10 = __VERIFIER_nondet_long() [L124] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L125] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L125] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=128, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L126] var_1_12 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L127] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L128] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L128] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L129] var_1_15 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L132] var_1_16 = __VERIFIER_nondet_uchar() [L133] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L134] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L134] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L135] var_1_18 = __VERIFIER_nondet_double() [L136] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L136] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L137] var_1_19 = __VERIFIER_nondet_double() [L138] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L138] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L139] var_1_20 = __VERIFIER_nondet_double() [L140] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L140] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L141] var_1_21 = __VERIFIER_nondet_double() [L142] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L142] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L143] var_1_22 = __VERIFIER_nondet_double() [L144] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L144] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L145] var_1_23 = __VERIFIER_nondet_double() [L146] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L146] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=-64, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L147] var_1_25 = __VERIFIER_nondet_long() [L148] CALL assume_abort_if_not(var_1_25 >= -2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L148] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L149] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L149] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L150] var_1_27 = __VERIFIER_nondet_char() [L151] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L151] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L152] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L152] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L153] var_1_28 = __VERIFIER_nondet_char() [L154] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L154] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L155] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L155] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L168] RET updateVariables() [L169] CALL step() [L56] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L56] COND TRUE 32u < ((var_1_2 + 4u) | var_1_3) [L57] var_1_1 = (var_1_4 + (var_1_5 + var_1_6)) VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L65] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=500, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L65] signed long int stepLocal_0 = var_1_9 >> var_1_4; [L66] COND TRUE stepLocal_0 < var_1_1 [L67] var_1_11 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L69] unsigned short int stepLocal_1 = var_1_11; VAL [isInitial=1, stepLocal_1=505, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=64, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L70] COND TRUE var_1_2 != stepLocal_1 [L71] var_1_13 = ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=15/2, var_1_1=505, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L73] COND FALSE !(\read(var_1_7)) [L76] var_1_17 = var_1_22 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L78] signed long int stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=10, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L79] COND TRUE ! var_1_7 [L80] var_1_24 = (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))) VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=16, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L88] COND TRUE var_1_8 >= var_1_1 [L89] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L91] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, stepLocal_2=0, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L94] var_1_30 = var_1_12 [L95] var_1_31 = var_1_25 [L96] var_1_32 = var_1_16 [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160] EXPR ((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L160-L161] return ((((((((((32u < ((var_1_2 + 4u) | var_1_3)) ? (var_1_1 == ((signed long int) (var_1_4 + (var_1_5 + var_1_6)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_4) < ((var_1_8 - var_1_9))) ? (var_1_4) : ((var_1_8 - var_1_9)))))) : (var_1_1 == ((signed long int) (var_1_9 - var_1_10))))) && (((var_1_9 >> var_1_4) < var_1_1) ? (var_1_11 == ((unsigned short int) var_1_12)) : 1)) && ((var_1_2 != var_1_11) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) < ((var_1_13 + var_1_15))) ? (((((var_1_9) > (var_1_12)) ? (var_1_9) : (var_1_12)))) : ((var_1_13 + var_1_15))))))) : ((var_1_10 < var_1_9) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_25))))) && ((var_1_8 >= var_1_1) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_12))) && (var_1_31 == ((signed long int) var_1_25))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L170] RET, EXPR property() [L170] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=505, var_1_12=505, var_1_13=253, var_1_15=253, var_1_16=-2, var_1_17=2147483651, var_1_1=505, var_1_22=2147483651, var_1_24=0, var_1_25=2147483646, var_1_26=-126, var_1_27=-63, var_1_28=-63, var_1_29=31897/500, var_1_2=29, var_1_30=505, var_1_31=2147483646, var_1_32=-2, var_1_3=-4294967263, var_1_4=0, var_1_5=536870912, var_1_6=-536870407, var_1_7=0, var_1_8=505, var_1_9=504] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 261 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 261 mSDsluCounter, 2448 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1515 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 933 mSDtfsCounter, 513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 480 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=6, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 97 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1558 NumberOfCodeBlocks, 1558 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1328 ConstructedInterpolants, 0 QuantifiedInterpolants, 2533 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 15120/15120 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 07:35:01,662 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_codestructure_steplocals_file-63.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 b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:35:03,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:35:03,731 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:35:03,736 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:35:03,736 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:35:03,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:35:03,767 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:35:03,768 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:35:03,768 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:35:03,770 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:35:03,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:35:03,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:35:03,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:35:03,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:35:03,771 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:35:03,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:35:03,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:35:03,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:35:03,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:35:03,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:35:03,773 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:35:03,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:35:03,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:35:03,775 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:35:03,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:35:03,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:35:03,776 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:35:03,776 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:35:03,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:35:03,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:35:03,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:35:03,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:35:03,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:35:03,778 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:35:03,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:35:03,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:35:03,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:35:03,779 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:35:03,779 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:35:03,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:35:03,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:35:03,780 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:35:03,780 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:35:03,780 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:35:03,781 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:35:03,781 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 -> b6fe4dae999e1d5cc51fc4d3228e53330e71c772d276083f0806e06778fb8d09 [2024-10-11 07:35:04,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:35:04,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:35:04,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:35:04,096 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:35:04,097 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:35:04,098 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-11 07:35:05,728 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:35:05,895 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:35:05,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-10-11 07:35:05,910 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d0321aeb/9c1bd6d6b87542d389f4173a3ec5dc56/FLAG9ce2893c1 [2024-10-11 07:35:05,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4d0321aeb/9c1bd6d6b87542d389f4173a3ec5dc56 [2024-10-11 07:35:05,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:35:05,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:35:05,937 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:35:05,937 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:35:05,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:35:05,942 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:35:05" (1/1) ... [2024-10-11 07:35:05,943 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8107c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:05, skipping insertion in model container [2024-10-11 07:35:05,944 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:35:05" (1/1) ... [2024-10-11 07:35:05,969 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:35:06,111 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_codestructure_steplocals_file-63.i[917,930] [2024-10-11 07:35:06,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:35:06,194 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:35:06,205 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_codestructure_steplocals_file-63.i[917,930] [2024-10-11 07:35:06,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:35:06,263 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:35:06,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06 WrapperNode [2024-10-11 07:35:06,264 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:35:06,265 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:35:06,265 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:35:06,265 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:35:06,271 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,286 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,318 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-10-11 07:35:06,319 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:35:06,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:35:06,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:35:06,324 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:35:06,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,334 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,341 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,357 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 07:35:06,358 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,358 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,381 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,388 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,390 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,393 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:35:06,394 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:35:06,394 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:35:06,394 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:35:06,394 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (1/1) ... [2024-10-11 07:35:06,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:35:06,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:35:06,425 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 07:35:06,437 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 07:35:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:35:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:35:06,473 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:35:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:35:06,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:35:06,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:35:06,570 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:35:06,572 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:35:13,708 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 07:35:13,708 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:35:13,755 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:35:13,756 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:35:13,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:13 BoogieIcfgContainer [2024-10-11 07:35:13,757 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:35:13,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:35:13,758 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:35:13,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:35:13,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:35:05" (1/3) ... [2024-10-11 07:35:13,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509ec0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:35:13, skipping insertion in model container [2024-10-11 07:35:13,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:35:06" (2/3) ... [2024-10-11 07:35:13,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@509ec0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:35:13, skipping insertion in model container [2024-10-11 07:35:13,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:35:13" (3/3) ... [2024-10-11 07:35:13,763 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2024-10-11 07:35:13,774 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:35:13,775 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:35:13,828 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:35:13,835 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;@1ecfe031, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:35:13,836 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:35:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:35:13,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 07:35:13,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:13,857 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:13,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:13,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:13,861 INFO L85 PathProgramCache]: Analyzing trace with hash 211713354, now seen corresponding path program 1 times [2024-10-11 07:35:13,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:13,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1301556769] [2024-10-11 07:35:13,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:13,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 07:35:13,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:13,882 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 07:35:13,883 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 07:35:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:14,250 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:35:14,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:35:14,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 1174 proven. 0 refuted. 0 times theorem prover too weak. 1346 trivial. 0 not checked. [2024-10-11 07:35:14,304 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:35:14,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:35:14,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1301556769] [2024-10-11 07:35:14,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1301556769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:14,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:14,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:35:14,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643945485] [2024-10-11 07:35:14,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:14,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:35:14,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:35:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:35:14,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:35:14,331 INFO L87 Difference]: Start difference. First operand has 82 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 44 states have internal predecessors, (57), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 07:35:17,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.86s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:17,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:17,231 INFO L93 Difference]: Finished difference Result 161 states and 292 transitions. [2024-10-11 07:35:17,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:35:17,268 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 216 [2024-10-11 07:35:17,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:17,275 INFO L225 Difference]: With dead ends: 161 [2024-10-11 07:35:17,275 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 07:35:17,283 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 215 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 07:35:17,286 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:17,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-10-11 07:35:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 07:35:17,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-11 07:35:17,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 36 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:35:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 124 transitions. [2024-10-11 07:35:17,378 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 124 transitions. Word has length 216 [2024-10-11 07:35:17,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:17,378 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 124 transitions. [2024-10-11 07:35:17,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2024-10-11 07:35:17,379 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 124 transitions. [2024-10-11 07:35:17,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 07:35:17,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:17,388 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:17,403 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 07:35:17,589 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 07:35:17,590 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:17,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:17,591 INFO L85 PathProgramCache]: Analyzing trace with hash -996200834, now seen corresponding path program 1 times [2024-10-11 07:35:17,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:17,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23037456] [2024-10-11 07:35:17,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:17,593 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 07:35:17,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:17,595 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 07:35:17,596 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 07:35:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:17,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:35:17,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:35:18,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:35:18,013 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:35:18,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:35:18,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23037456] [2024-10-11 07:35:18,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23037456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:18,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:18,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:35:18,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523654511] [2024-10-11 07:35:18,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:18,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:35:18,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:35:18,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:35:18,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:35:18,017 INFO L87 Difference]: Start difference. First operand 80 states and 124 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:20,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:24,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:25,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:25,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:25,951 INFO L93 Difference]: Finished difference Result 193 states and 296 transitions. [2024-10-11 07:35:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:35:25,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 216 [2024-10-11 07:35:25,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:25,955 INFO L225 Difference]: With dead ends: 193 [2024-10-11 07:35:25,955 INFO L226 Difference]: Without dead ends: 114 [2024-10-11 07:35:25,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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 07:35:25,957 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:25,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 264 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2024-10-11 07:35:25,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-11 07:35:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2024-10-11 07:35:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 63 states have internal predecessors, (76), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 07:35:25,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2024-10-11 07:35:25,975 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 216 [2024-10-11 07:35:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:25,976 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2024-10-11 07:35:25,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:25,976 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2024-10-11 07:35:25,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 07:35:25,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:25,980 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:25,996 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 07:35:26,180 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 07:35:26,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:26,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:26,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1805547460, now seen corresponding path program 1 times [2024-10-11 07:35:26,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:26,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703382456] [2024-10-11 07:35:26,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:26,183 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 07:35:26,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:26,185 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 07:35:26,190 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 07:35:26,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:26,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 07:35:26,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:35:26,622 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-10-11 07:35:26,623 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:35:26,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:35:26,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703382456] [2024-10-11 07:35:26,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703382456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:35:26,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:35:26,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:35:26,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629289872] [2024-10-11 07:35:26,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:35:26,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:35:26,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:35:26,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:35:26,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:35:26,625 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:29,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:33,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:35:33,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:35:33,452 INFO L93 Difference]: Finished difference Result 233 states and 348 transitions. [2024-10-11 07:35:33,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:35:33,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 216 [2024-10-11 07:35:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:35:33,458 INFO L225 Difference]: With dead ends: 233 [2024-10-11 07:35:33,458 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 07:35:33,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 214 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 07:35:33,464 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 41 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-10-11 07:35:33,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 236 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2024-10-11 07:35:33,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 07:35:33,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 98. [2024-10-11 07:35:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2024-10-11 07:35:33,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 144 transitions. [2024-10-11 07:35:33,491 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 144 transitions. Word has length 216 [2024-10-11 07:35:33,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:35:33,491 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 144 transitions. [2024-10-11 07:35:33,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2024-10-11 07:35:33,492 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 144 transitions. [2024-10-11 07:35:33,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 07:35:33,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:35:33,497 INFO L215 NwaCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:35:33,514 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 07:35:33,697 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 07:35:33,698 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:35:33,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:35:33,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1805487878, now seen corresponding path program 1 times [2024-10-11 07:35:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:35:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733029779] [2024-10-11 07:35:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:35:33,702 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 07:35:33,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:35:33,708 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 07:35:33,713 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 07:35:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:35:34,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-11 07:35:34,126 INFO L278 TraceCheckSpWp]: Computing forward predicates...