./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-c7c6ca5-m [2024-11-08 19:48:45,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:48:45,833 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:48:45,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:48:45,837 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:48:45,858 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:48:45,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:48:45,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:48:45,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:48:45,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:48:45,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:48:45,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:48:45,862 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:48:45,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:48:45,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:48:45,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:48:45,864 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:48:45,864 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:48:45,864 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:48:45,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:48:45,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:48:45,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:48:45,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:48:45,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:48:45,869 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:48:45,869 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:48:45,869 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:48:45,870 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:48:45,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:48:45,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:48:45,871 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:48:45,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:48:45,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:48:45,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:48:45,872 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:48:45,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:48:45,873 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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-11-08 19:48:46,113 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:48:46,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:48:46,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:48:46,138 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:48:46,139 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:48:46,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-11-08 19:48:47,421 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:48:47,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:48:47,618 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-11-08 19:48:47,637 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae171078/14394a1ec0664bc88c70312cc1ac96fd/FLAG3e9c85ee5 [2024-11-08 19:48:48,010 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aae171078/14394a1ec0664bc88c70312cc1ac96fd [2024-11-08 19:48:48,012 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:48:48,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:48:48,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:48:48,015 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:48:48,024 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:48:48,024 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,025 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70de35ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48, skipping insertion in model container [2024-11-08 19:48:48,026 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,059 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:48:48,200 WARN L250 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-11-08 19:48:48,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:48:48,291 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:48:48,300 WARN L250 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-11-08 19:48:48,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:48:48,356 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:48:48,359 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48 WrapperNode [2024-11-08 19:48:48,359 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:48:48,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:48:48,360 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:48:48,361 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:48:48,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,413 INFO L138 Inliner]: procedures = 26, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 236 [2024-11-08 19:48:48,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:48:48,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:48:48,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:48:48,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:48:48,431 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,435 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,461 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-11-08 19:48:48,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,468 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,471 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,473 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,475 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:48:48,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:48:48,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:48:48,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:48:48,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (1/1) ... [2024-11-08 19:48:48,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:48:48,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:48:48,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:48:48,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:48:48,567 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:48:48,568 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:48:48,568 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:48:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:48:48,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:48:48,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:48:48,665 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:48:48,667 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:48:48,984 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-08 19:48:48,985 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:48:48,995 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:48:48,996 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:48:48,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:48:48 BoogieIcfgContainer [2024-11-08 19:48:48,996 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:48:48,998 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:48:48,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:48:49,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:48:49,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:48:48" (1/3) ... [2024-11-08 19:48:49,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239ae3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:48:49, skipping insertion in model container [2024-11-08 19:48:49,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:48" (2/3) ... [2024-11-08 19:48:49,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@239ae3dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:48:49, skipping insertion in model container [2024-11-08 19:48:49,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:48:48" (3/3) ... [2024-11-08 19:48:49,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2024-11-08 19:48:49,017 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:48:49,017 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:48:49,066 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:48:49,071 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;@ba3c0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:48:49,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:48:49,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 64 states have (on average 1.328125) internal successors, (85), 65 states have internal predecessors, (85), 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-11-08 19:48:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 19:48:49,087 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:49,088 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, 1, 1, 1] [2024-11-08 19:48:49,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:49,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:49,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1642252639, now seen corresponding path program 1 times [2024-11-08 19:48:49,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:49,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517463416] [2024-11-08 19:48:49,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:49,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:48:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:48:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:48:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:48:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:48:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:48:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:48:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:48:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:48:49,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:48:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:48:49,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:48:49,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:48:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:48:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:48:49,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:48:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:48:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:48:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:48:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:48:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:48:49,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:48:49,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:48:49,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:48:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:48:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:48:49,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:48:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:48:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:48:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 19:48:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 19:48:49,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:48:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:48:49,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 19:48:49,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 19:48:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 19:48:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:48:49,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:48:49,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517463416] [2024-11-08 19:48:49,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517463416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:48:49,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:48:49,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:48:49,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855090150] [2024-11-08 19:48:49,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:48:49,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:48:49,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:48:49,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:48:49,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:48:49,619 INFO L87 Difference]: Start difference. First operand has 103 states, 64 states have (on average 1.328125) internal successors, (85), 65 states have internal predecessors, (85), 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 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-11-08 19:48:49,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:48:49,650 INFO L93 Difference]: Finished difference Result 199 states and 344 transitions. [2024-11-08 19:48:49,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:48:49,654 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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 227 [2024-11-08 19:48:49,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:48:49,663 INFO L225 Difference]: With dead ends: 199 [2024-11-08 19:48:49,663 INFO L226 Difference]: Without dead ends: 99 [2024-11-08 19:48:49,667 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-11-08 19:48:49,670 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:48:49,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:48:49,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-08 19:48:49,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-08 19:48:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.278688524590164) internal successors, (78), 61 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-11-08 19:48:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 150 transitions. [2024-11-08 19:48:49,715 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 150 transitions. Word has length 227 [2024-11-08 19:48:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:48:49,720 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 150 transitions. [2024-11-08 19:48:49,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 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-11-08 19:48:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 150 transitions. [2024-11-08 19:48:49,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 19:48:49,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:49,725 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, 1, 1, 1] [2024-11-08 19:48:49,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:48:49,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:49,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:49,726 INFO L85 PathProgramCache]: Analyzing trace with hash -2004285805, now seen corresponding path program 1 times [2024-11-08 19:48:49,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:49,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754924795] [2024-11-08 19:48:49,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:49,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:48:49,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:48:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:48:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:48:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:48:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:48:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:48:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:48:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:48:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:48:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:48:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:48:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:48:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:48:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:48:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:48:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:48:49,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:48:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:48:49,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:48:49,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:48:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:48:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:49,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:48:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:48:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:48:50,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:48:50,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:48:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:48:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:48:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 19:48:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 19:48:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:48:50,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:48:50,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 19:48:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 19:48:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 19:48:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:48:50,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:48:50,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754924795] [2024-11-08 19:48:50,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754924795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:48:50,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:48:50,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:48:50,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181929244] [2024-11-08 19:48:50,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:48:50,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:48:50,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:48:50,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:48:50,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:48:50,057 INFO L87 Difference]: Start difference. First operand 99 states and 150 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-08 19:48:50,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:48:50,140 INFO L93 Difference]: Finished difference Result 243 states and 365 transitions. [2024-11-08 19:48:50,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:48:50,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 227 [2024-11-08 19:48:50,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:48:50,145 INFO L225 Difference]: With dead ends: 243 [2024-11-08 19:48:50,146 INFO L226 Difference]: Without dead ends: 147 [2024-11-08 19:48:50,147 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-11-08 19:48:50,148 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 63 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:48:50,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 323 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:48:50,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-08 19:48:50,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2024-11-08 19:48:50,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 95 states have (on average 1.2736842105263158) internal successors, (121), 96 states have internal predecessors, (121), 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-11-08 19:48:50,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 213 transitions. [2024-11-08 19:48:50,169 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 213 transitions. Word has length 227 [2024-11-08 19:48:50,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:48:50,170 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 213 transitions. [2024-11-08 19:48:50,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-08 19:48:50,173 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 213 transitions. [2024-11-08 19:48:50,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 19:48:50,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:50,176 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, 1, 1, 1] [2024-11-08 19:48:50,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:48:50,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:50,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:50,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1279564241, now seen corresponding path program 1 times [2024-11-08 19:48:50,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:50,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99924939] [2024-11-08 19:48:50,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:50,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:48:50,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:48:50,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:48:50,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:48:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:48:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:48:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:48:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:48:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:48:50,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:48:50,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:48:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:48:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:48:50,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:48:50,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:48:50,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:48:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:48:50,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:48:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:48:50,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:48:50,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:48:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:48:50,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:48:50,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:48:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:48:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:48:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:48:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:48:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:48:50,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 19:48:50,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 19:48:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:48:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:48:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 19:48:50,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 19:48:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 19:48:50,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:48:50,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:48:50,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99924939] [2024-11-08 19:48:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99924939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:48:50,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:48:50,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:48:50,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017485370] [2024-11-08 19:48:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:48:50,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:48:50,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:48:50,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:48:50,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:48:50,404 INFO L87 Difference]: Start difference. First operand 144 states and 213 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-08 19:48:50,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:48:50,460 INFO L93 Difference]: Finished difference Result 299 states and 439 transitions. [2024-11-08 19:48:50,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:48:50,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 227 [2024-11-08 19:48:50,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:48:50,463 INFO L225 Difference]: With dead ends: 299 [2024-11-08 19:48:50,464 INFO L226 Difference]: Without dead ends: 158 [2024-11-08 19:48:50,465 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-11-08 19:48:50,465 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 62 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:48:50,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 291 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:48:50,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-08 19:48:50,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 121. [2024-11-08 19:48:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 82 states have (on average 1.2682926829268293) internal successors, (104), 82 states have internal predecessors, (104), 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-11-08 19:48:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-08 19:48:50,481 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 227 [2024-11-08 19:48:50,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:48:50,482 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-08 19:48:50,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-11-08 19:48:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-08 19:48:50,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-08 19:48:50,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:50,489 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, 1, 1, 1] [2024-11-08 19:48:50,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:48:50,490 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:50,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:50,490 INFO L85 PathProgramCache]: Analyzing trace with hash 886537231, now seen corresponding path program 1 times [2024-11-08 19:48:50,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:50,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818006430] [2024-11-08 19:48:50,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:50,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:48:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:48:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:48:50,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:48:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:48:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:48:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:48:50,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:48:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:48:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:48:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:48:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:48:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:48:50,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:48:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:48:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:48:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:48:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:48:50,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:48:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:48:50,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:48:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:48:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:48:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:48:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:48:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:48:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:48:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:48:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:48:50,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 19:48:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 19:48:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:48:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:48:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 19:48:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:50,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 19:48:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 19:48:51,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:48:51,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:48:51,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818006430] [2024-11-08 19:48:51,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818006430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:48:51,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:48:51,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 19:48:51,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047512876] [2024-11-08 19:48:51,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:48:51,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 19:48:51,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:48:51,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 19:48:51,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 19:48:51,009 INFO L87 Difference]: Start difference. First operand 121 states and 176 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 19:48:51,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:48:51,183 INFO L93 Difference]: Finished difference Result 281 states and 404 transitions. [2024-11-08 19:48:51,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:48:51,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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 227 [2024-11-08 19:48:51,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:48:51,187 INFO L225 Difference]: With dead ends: 281 [2024-11-08 19:48:51,187 INFO L226 Difference]: Without dead ends: 163 [2024-11-08 19:48:51,187 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-11-08 19:48:51,191 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 35 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:48:51,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 665 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:48:51,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-08 19:48:51,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 160. [2024-11-08 19:48:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 119 states have internal predecessors, (151), 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-11-08 19:48:51,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 227 transitions. [2024-11-08 19:48:51,214 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 227 transitions. Word has length 227 [2024-11-08 19:48:51,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:48:51,215 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 227 transitions. [2024-11-08 19:48:51,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 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-11-08 19:48:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 227 transitions. [2024-11-08 19:48:51,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 19:48:51,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:51,218 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, 1, 1, 1, 1] [2024-11-08 19:48:51,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:48:51,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:51,219 INFO L85 PathProgramCache]: Analyzing trace with hash 237430254, now seen corresponding path program 1 times [2024-11-08 19:48:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092409417] [2024-11-08 19:48:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:48:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:48:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:48:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:48:51,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:48:51,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:48:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:48:51,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:48:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:48:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:48:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:48:51,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:48:51,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:48:51,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:48:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:48:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:48:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:48:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:48:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:48:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:48:51,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:48:51,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:48:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:48:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:48:51,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:48:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:48:51,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:48:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:48:51,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:48:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 19:48:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 19:48:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:48:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:48:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 19:48:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 19:48:51,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 19:48:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:48:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:48:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092409417] [2024-11-08 19:48:51,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092409417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:48:51,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:48:51,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:48:51,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519243702] [2024-11-08 19:48:51,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:48:51,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:48:51,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:48:51,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:48:51,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:48:51,890 INFO L87 Difference]: Start difference. First operand 160 states and 227 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-11-08 19:48:52,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:48:52,184 INFO L93 Difference]: Finished difference Result 405 states and 566 transitions. [2024-11-08 19:48:52,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 19:48:52,185 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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 228 [2024-11-08 19:48:52,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:48:52,188 INFO L225 Difference]: With dead ends: 405 [2024-11-08 19:48:52,188 INFO L226 Difference]: Without dead ends: 248 [2024-11-08 19:48:52,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:48:52,189 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 104 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:48:52,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1120 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:48:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-08 19:48:52,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 206. [2024-11-08 19:48:52,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 164 states have (on average 1.3231707317073171) internal successors, (217), 165 states have internal predecessors, (217), 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-11-08 19:48:52,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 293 transitions. [2024-11-08 19:48:52,203 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 293 transitions. Word has length 228 [2024-11-08 19:48:52,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:48:52,203 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 293 transitions. [2024-11-08 19:48:52,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 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-11-08 19:48:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 293 transitions. [2024-11-08 19:48:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-11-08 19:48:52,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:52,205 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, 1, 1, 1, 1] [2024-11-08 19:48:52,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:48:52,206 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:52,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:52,206 INFO L85 PathProgramCache]: Analyzing trace with hash 598247880, now seen corresponding path program 1 times [2024-11-08 19:48:52,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:52,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358096435] [2024-11-08 19:48:52,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:52,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:52,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 19:48:52,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 19:48:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 19:48:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 19:48:52,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:48:52,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 19:48:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:48:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 19:48:52,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:48:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 19:48:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:48:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 19:48:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:48:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 19:48:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:48:52,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 19:48:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:48:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 19:48:52,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 19:48:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 19:48:52,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 19:48:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 19:48:52,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 19:48:52,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 19:48:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 19:48:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-08 19:48:52,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-08 19:48:52,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:48:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:48:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-08 19:48:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2024-11-08 19:48:52,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 178 [2024-11-08 19:48:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2024-11-08 19:48:52,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2024-11-08 19:48:52,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2024-11-08 19:48:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2024-11-08 19:48:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:48:52,409 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:48:52,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:48:52,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358096435] [2024-11-08 19:48:52,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358096435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:48:52,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:48:52,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:48:52,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357813462] [2024-11-08 19:48:52,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:48:52,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:48:52,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:48:52,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:48:52,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:48:52,412 INFO L87 Difference]: Start difference. First operand 206 states and 293 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11-08 19:48:52,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:48:52,447 INFO L93 Difference]: Finished difference Result 454 states and 642 transitions. [2024-11-08 19:48:52,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:48:52,448 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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 228 [2024-11-08 19:48:52,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:48:52,449 INFO L225 Difference]: With dead ends: 454 [2024-11-08 19:48:52,450 INFO L226 Difference]: Without dead ends: 251 [2024-11-08 19:48:52,450 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-11-08 19:48:52,451 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 34 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:48:52,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 311 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:48:52,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-08 19:48:52,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 229. [2024-11-08 19:48:52,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 187 states have (on average 1.3262032085561497) internal successors, (248), 188 states have internal predecessors, (248), 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-11-08 19:48:52,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 324 transitions. [2024-11-08 19:48:52,465 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 324 transitions. Word has length 228 [2024-11-08 19:48:52,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:48:52,465 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 324 transitions. [2024-11-08 19:48:52,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 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-11-08 19:48:52,466 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 324 transitions. [2024-11-08 19:48:52,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2024-11-08 19:48:52,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:48:52,467 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, 1, 1, 1, 1, 1] [2024-11-08 19:48:52,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:48:52,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:48:52,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:48:52,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1010300778, now seen corresponding path program 1 times [2024-11-08 19:48:52,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:48:52,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750207490] [2024-11-08 19:48:52,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:48:52,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:48:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:48:52,551 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 19:48:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 19:48:52,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 19:48:52,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 19:48:52,704 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:48:52,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:48:52,709 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:48:52,842 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:48:52,847 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:48:52 BoogieIcfgContainer [2024-11-08 19:48:52,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:48:52,848 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:48:52,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:48:52,849 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:48:52,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:48:48" (3/4) ... [2024-11-08 19:48:52,851 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 19:48:52,852 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:48:52,853 INFO L158 Benchmark]: Toolchain (without parser) took 4839.35ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 116.4MB in the beginning and 198.1MB in the end (delta: -81.7MB). Peak memory consumption was 6.4MB. Max. memory is 16.1GB. [2024-11-08 19:48:52,853 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 100.7MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:48:52,853 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.88ms. Allocated memory is still 159.4MB. Free memory was 116.4MB in the beginning and 100.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 19:48:52,853 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.62ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 96.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:48:52,854 INFO L158 Benchmark]: Boogie Preprocessor took 64.08ms. Allocated memory is still 159.4MB. Free memory was 96.5MB in the beginning and 92.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:48:52,854 INFO L158 Benchmark]: RCFGBuilder took 517.65ms. Allocated memory is still 159.4MB. Free memory was 91.8MB in the beginning and 108.6MB in the end (delta: -16.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-08 19:48:52,855 INFO L158 Benchmark]: TraceAbstraction took 3850.55ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 107.8MB in the beginning and 199.2MB in the end (delta: -91.4MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. [2024-11-08 19:48:52,855 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 247.5MB. Free memory is still 198.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:48:52,856 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.10ms. Allocated memory is still 100.7MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.88ms. Allocated memory is still 159.4MB. Free memory was 116.4MB in the beginning and 100.1MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.62ms. Allocated memory is still 159.4MB. Free memory was 100.1MB in the beginning and 96.5MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.08ms. Allocated memory is still 159.4MB. Free memory was 96.5MB in the beginning and 92.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 517.65ms. Allocated memory is still 159.4MB. Free memory was 91.8MB in the beginning and 108.6MB in the end (delta: -16.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3850.55ms. Allocated memory was 159.4MB in the beginning and 247.5MB in the end (delta: 88.1MB). Free memory was 107.8MB in the beginning and 199.2MB in the end (delta: -91.4MB). Peak memory consumption was 126.5MB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 247.5MB. Free memory is still 198.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of 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; VAL [isInitial=0, 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_2=50, 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] [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=1073741823, 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=1073741823, 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=1073741823, 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=1073741823, 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=1073741823, 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=1073741823, 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=1073741823, var_1_5=-536870911, 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=1073741823, var_1_5=-536870911, 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=1073741823, var_1_5=-536870911, 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=1073741823, var_1_5=-536870911, 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=1073741823, var_1_5=-536870911, 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=1073741823, var_1_5=-536870911, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L124] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L125] CALL assume_abort_if_not(var_1_10 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L125] RET assume_abort_if_not(var_1_10 <= 2147483646) VAL [isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L127] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, var_1_10=2147483646, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L128] CALL assume_abort_if_not(var_1_12 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L128] RET assume_abort_if_not(var_1_12 <= 65534) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L130] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L131] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L131] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L133] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L134] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L134] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L148] RET assume_abort_if_not(var_1_25 >= -2147483647) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L149] CALL assume_abort_if_not(var_1_25 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L149] RET assume_abort_if_not(var_1_25 <= 2147483646) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L151] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L152] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L152] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L154] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L155] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L155] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L168] RET updateVariables() [L169] CALL step() [L56] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, var_1_17=15/2, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L65] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=2147483646, var_1_11=500, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, var_1_17=15/2, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=0, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, var_1_17=15/2, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L69] unsigned short int stepLocal_1 = var_1_11; VAL [isInitial=1, stepLocal_1=0, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=64, var_1_15=4, var_1_16=7, var_1_17=15/2, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=15/2, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L73] COND FALSE !(\read(var_1_7)) [L76] var_1_17 = var_1_22 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L78] signed long int stepLocal_2 = var_1_10; VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L88] COND TRUE var_1_8 >= var_1_1 [L89] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L91] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L94] var_1_30 = var_1_12 [L95] var_1_31 = var_1_25 [L96] var_1_32 = var_1_16 VAL [isInitial=1, stepLocal_2=2147483646, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L169] RET step() [L170] CALL, EXPR property() [L160] EXPR (var_1_2 + 4u) | var_1_3 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L160] EXPR var_1_9 >> var_1_4 VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [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=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=2147483646, var_1_11=0, var_1_12=0, var_1_13=4, var_1_15=4, var_1_16=7, var_1_17=2147483651, var_1_1=1073741822, 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=-4, var_1_30=0, var_1_31=2147483646, var_1_32=7, var_1_3=-1, var_1_4=1073741823, var_1_5=-536870911, var_1_6=536870910, var_1_7=0, var_1_8=1073741823, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 7, TraceHistogramMax: 36, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 298 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 2860 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1862 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 483 IncrementalHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 998 mSDtfsCounter, 483 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 481 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=229occurred 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, 107 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1593 NumberOfCodeBlocks, 1593 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1358 ConstructedInterpolants, 0 QuantifiedInterpolants, 2296 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-11-08 19:48:52,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-c7c6ca5-m [2024-11-08 19:48:54,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:48:54,880 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 19:48:54,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:48:54,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:48:54,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:48:54,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:48:54,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:48:54,913 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:48:54,913 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:48:54,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:48:54,914 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:48:54,914 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:48:54,915 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:48:54,915 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:48:54,915 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:48:54,915 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:48:54,915 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:48:54,916 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:48:54,916 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:48:54,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:48:54,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:48:54,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:48:54,921 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 19:48:54,922 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 19:48:54,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:48:54,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 19:48:54,922 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:48:54,923 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:48:54,923 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:48:54,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:48:54,924 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:48:54,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:48:54,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:48:54,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:48:54,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:48:54,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:48:54,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:48:54,931 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 19:48:54,931 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 19:48:54,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:48:54,933 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:48:54,933 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:48:54,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:48:54,933 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/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-11-08 19:48:55,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:48:55,218 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:48:55,221 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:48:55,222 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:48:55,222 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:48:55,223 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-11-08 19:48:56,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:48:56,771 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:48:56,771 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-63.i [2024-11-08 19:48:56,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6288a3a/30123b1697e545d78d63a5394c6b6207/FLAG775ed7b2d [2024-11-08 19:48:56,806 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d6288a3a/30123b1697e545d78d63a5394c6b6207 [2024-11-08 19:48:56,808 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:48:56,809 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:48:56,818 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:48:56,818 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:48:56,824 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:48:56,825 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:48:56" (1/1) ... [2024-11-08 19:48:56,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69f064c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:56, skipping insertion in model container [2024-11-08 19:48:56,826 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:48:56" (1/1) ... [2024-11-08 19:48:56,848 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:48:56,997 WARN L250 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-11-08 19:48:57,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:48:57,079 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:48:57,089 WARN L250 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-11-08 19:48:57,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:48:57,134 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:48:57,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57 WrapperNode [2024-11-08 19:48:57,134 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:48:57,135 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:48:57,135 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:48:57,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:48:57,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,154 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,187 INFO L138 Inliner]: procedures = 27, calls = 49, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-08 19:48:57,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:48:57,195 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:48:57,195 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:48:57,195 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:48:57,204 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,205 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,209 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,233 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-11-08 19:48:57,237 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,237 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,245 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,258 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,267 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:48:57,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:48:57,271 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:48:57,271 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:48:57,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (1/1) ... [2024-11-08 19:48:57,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:48:57,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 19:48:57,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:48:57,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:48:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:48:57,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 19:48:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:48:57,350 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:48:57,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:48:57,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:48:57,440 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:48:57,443 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:49:04,519 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-08 19:49:04,520 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:49:04,530 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:49:04,531 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 19:49:04,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:04 BoogieIcfgContainer [2024-11-08 19:49:04,531 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:49:04,533 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:49:04,533 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:49:04,536 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:49:04,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:48:56" (1/3) ... [2024-11-08 19:49:04,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e5094c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:49:04, skipping insertion in model container [2024-11-08 19:49:04,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:48:57" (2/3) ... [2024-11-08 19:49:04,537 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38e5094c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:49:04, skipping insertion in model container [2024-11-08 19:49:04,537 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:49:04" (3/3) ... [2024-11-08 19:49:04,538 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-63.i [2024-11-08 19:49:04,552 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:49:04,553 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:49:04,611 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:49:04,619 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;@3ad63fe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:49:04,620 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:49:04,624 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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-11-08 19:49:04,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:49:04,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:04,641 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] [2024-11-08 19:49:04,641 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:04,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:04,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1993502336, now seen corresponding path program 1 times [2024-11-08 19:49:04,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:04,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [441519626] [2024-11-08 19:49:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:04,661 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-11-08 19:49:04,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:04,663 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-11-08 19:49:04,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 19:49:05,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:05,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 19:49:05,089 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:05,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1666 trivial. 0 not checked. [2024-11-08 19:49:05,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:49:05,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:49:05,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [441519626] [2024-11-08 19:49:05,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [441519626] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:49:05,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:49:05,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:49:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887098434] [2024-11-08 19:49:05,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:49:05,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:49:05,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:49:05,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:49:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:49:05,176 INFO L87 Difference]: Start difference. First operand has 89 states, 50 states have (on average 1.28) internal successors, (64), 51 states have internal predecessors, (64), 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-11-08 19:49:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:05,204 INFO L93 Difference]: Finished difference Result 171 states and 302 transitions. [2024-11-08 19:49:05,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:49:05,207 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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 221 [2024-11-08 19:49:05,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:05,216 INFO L225 Difference]: With dead ends: 171 [2024-11-08 19:49:05,217 INFO L226 Difference]: Without dead ends: 85 [2024-11-08 19:49:05,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 220 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-11-08 19:49:05,225 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:05,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:49:05,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-08 19:49:05,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-11-08 19:49:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 47 states have (on average 1.2127659574468086) internal successors, (57), 47 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-11-08 19:49:05,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 129 transitions. [2024-11-08 19:49:05,266 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 129 transitions. Word has length 221 [2024-11-08 19:49:05,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:05,266 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 129 transitions. [2024-11-08 19:49:05,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 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-11-08 19:49:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 129 transitions. [2024-11-08 19:49:05,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:49:05,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:05,271 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] [2024-11-08 19:49:05,284 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 19:49:05,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-11-08 19:49:05,476 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:05,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:05,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1137100212, now seen corresponding path program 1 times [2024-11-08 19:49:05,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:05,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [705316243] [2024-11-08 19:49:05,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:05,478 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-11-08 19:49:05,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:05,480 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-11-08 19:49:05,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 19:49:05,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:05,855 INFO L255 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:49:05,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:49:05,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:49:05,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:49:05,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [705316243] [2024-11-08 19:49:05,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [705316243] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:49:05,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:49:05,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:49:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865336495] [2024-11-08 19:49:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:49:05,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:49:05,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:49:05,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:49:05,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:49:05,919 INFO L87 Difference]: Start difference. First operand 85 states and 129 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-08 19:49:07,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:49:11,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:49:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:11,572 INFO L93 Difference]: Finished difference Result 204 states and 307 transitions. [2024-11-08 19:49:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:49:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 221 [2024-11-08 19:49:11,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:11,608 INFO L225 Difference]: With dead ends: 204 [2024-11-08 19:49:11,608 INFO L226 Difference]: Without dead ends: 122 [2024-11-08 19:49:11,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 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-11-08 19:49:11,610 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 47 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:11,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-08 19:49:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-08 19:49:11,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 119. [2024-11-08 19:49:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 70 states have (on average 1.2) internal successors, (84), 71 states have internal predecessors, (84), 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-11-08 19:49:11,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 176 transitions. [2024-11-08 19:49:11,626 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 176 transitions. Word has length 221 [2024-11-08 19:49:11,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:11,626 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 176 transitions. [2024-11-08 19:49:11,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-08 19:49:11,627 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 176 transitions. [2024-11-08 19:49:11,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:49:11,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:11,629 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] [2024-11-08 19:49:11,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-08 19:49:11,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-11-08 19:49:11,831 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:11,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:11,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1194358514, now seen corresponding path program 1 times [2024-11-08 19:49:11,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:11,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267637278] [2024-11-08 19:49:11,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:11,833 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-11-08 19:49:11,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:11,834 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-11-08 19:49:11,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 19:49:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:12,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 19:49:12,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:49:12,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2520 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2520 trivial. 0 not checked. [2024-11-08 19:49:12,260 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:49:12,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 19:49:12,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267637278] [2024-11-08 19:49:12,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267637278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:49:12,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:49:12,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:49:12,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634739199] [2024-11-08 19:49:12,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:49:12,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:49:12,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 19:49:12,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:49:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:49:12,265 INFO L87 Difference]: Start difference. First operand 119 states and 176 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-08 19:49:17,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.57s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 19:49:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:49:17,154 INFO L93 Difference]: Finished difference Result 247 states and 362 transitions. [2024-11-08 19:49:17,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:49:17,155 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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 221 [2024-11-08 19:49:17,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:49:17,157 INFO L225 Difference]: With dead ends: 247 [2024-11-08 19:49:17,158 INFO L226 Difference]: Without dead ends: 131 [2024-11-08 19:49:17,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 219 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-11-08 19:49:17,160 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-08 19:49:17,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-08 19:49:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-08 19:49:17,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2024-11-08 19:49:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 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-11-08 19:49:17,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 149 transitions. [2024-11-08 19:49:17,185 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 149 transitions. Word has length 221 [2024-11-08 19:49:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:49:17,186 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 149 transitions. [2024-11-08 19:49:17,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 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-11-08 19:49:17,187 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 149 transitions. [2024-11-08 19:49:17,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-11-08 19:49:17,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:49:17,189 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] [2024-11-08 19:49:17,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-08 19:49:17,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-11-08 19:49:17,391 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:49:17,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:49:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 801331504, now seen corresponding path program 1 times [2024-11-08 19:49:17,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 19:49:17,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296560053] [2024-11-08 19:49:17,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:49:17,392 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-11-08 19:49:17,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 19:49:17,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-11-08 19:49:17,395 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-11-08 19:49:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:49:17,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-08 19:49:17,832 INFO L278 TraceCheckSpWp]: Computing forward predicates...