./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:58:21,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:58:21,427 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 08:58:21,433 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:58:21,437 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:58:21,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:58:21,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:58:21,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:58:21,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:58:21,473 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:58:21,473 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:58:21,474 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:58:21,474 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:58:21,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:58:21,475 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:58:21,475 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:58:21,477 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:58:21,478 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:58:21,478 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 08:58:21,478 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:58:21,478 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:58:21,479 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:58:21,482 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:58:21,483 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:58:21,483 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:58:21,484 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:58:21,484 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:58:21,484 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:58:21,484 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:58:21,484 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:58:21,485 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:58:21,485 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:58:21,485 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:58:21,485 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:58:21,485 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:58:21,486 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:58:21,486 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 08:58:21,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 08:58:21,488 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:58:21,488 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:58:21,488 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:58:21,489 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:58:21,489 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 [2024-10-11 08:58:21,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:58:21,779 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:58:21,782 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:58:21,784 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:58:21,784 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:58:21,786 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-10-11 08:58:23,166 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:58:23,360 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:58:23,364 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-10-11 08:58:23,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef358850c/803588e441484d348e998fc040fe9b85/FLAG09e2b68ec [2024-10-11 08:58:23,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/ef358850c/803588e441484d348e998fc040fe9b85 [2024-10-11 08:58:23,394 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:58:23,395 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:58:23,397 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:58:23,397 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:58:23,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:58:23,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,404 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59fd8287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23, skipping insertion in model container [2024-10-11 08:58:23,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,429 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:58:23,606 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i[919,932] [2024-10-11 08:58:23,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:58:23,687 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:58:23,698 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i[919,932] [2024-10-11 08:58:23,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:58:23,772 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:58:23,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23 WrapperNode [2024-10-11 08:58:23,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:58:23,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:58:23,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:58:23,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:58:23,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,873 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 224 [2024-10-11 08:58:23,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:58:23,874 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:58:23,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:58:23,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:58:23,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,896 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,936 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:58:23,939 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,940 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,950 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,953 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,957 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:58:23,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:58:23,967 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:58:23,967 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:58:23,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (1/1) ... [2024-10-11 08:58:23,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:58:23,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:58:24,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:58:24,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:58:24,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:58:24,051 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:58:24,051 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:58:24,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 08:58:24,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:58:24,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:58:24,132 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:58:24,136 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:58:24,500 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 08:58:24,500 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:58:24,537 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:58:24,537 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:58:24,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:58:24 BoogieIcfgContainer [2024-10-11 08:58:24,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:58:24,541 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:58:24,541 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:58:24,545 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:58:24,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:58:23" (1/3) ... [2024-10-11 08:58:24,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e81e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:58:24, skipping insertion in model container [2024-10-11 08:58:24,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:23" (2/3) ... [2024-10-11 08:58:24,546 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34e81e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:58:24, skipping insertion in model container [2024-10-11 08:58:24,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:58:24" (3/3) ... [2024-10-11 08:58:24,548 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-10-11 08:58:24,561 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:58:24,561 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:58:24,617 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:58:24,623 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;@66026da4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:58:24,623 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:58:24,627 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:58:24,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:58:24,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:24,646 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:24,647 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:24,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:24,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1619624167, now seen corresponding path program 1 times [2024-10-11 08:58:24,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:24,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810865552] [2024-10-11 08:58:24,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:24,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:24,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:58:24,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:58:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:58:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:58:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:58:25,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 08:58:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:58:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:58:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:58:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:58:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:58:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:58:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:58:25,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:58:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:58:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:58:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:58:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:58:25,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:58:25,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:58:25,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:58:25,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:58:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:58:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:58:25,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:58:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:58:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:58:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:58:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:58:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:58:25,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:58:25,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810865552] [2024-10-11 08:58:25,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810865552] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:58:25,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:58:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:58:25,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131636198] [2024-10-11 08:58:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:58:25,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:58:25,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:58:25,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:58:25,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:58:25,228 INFO L87 Difference]: Start difference. First operand has 93 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 62 states have internal predecessors, (92), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:58:25,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:58:25,275 INFO L93 Difference]: Finished difference Result 179 states and 321 transitions. [2024-10-11 08:58:25,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:58:25,278 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2024-10-11 08:58:25,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:58:25,285 INFO L225 Difference]: With dead ends: 179 [2024-10-11 08:58:25,286 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 08:58:25,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:58:25,296 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:58:25,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:58:25,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 08:58:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2024-10-11 08:58:25,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 56 states have internal predecessors, (75), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:58:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 133 transitions. [2024-10-11 08:58:25,358 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 133 transitions. Word has length 187 [2024-10-11 08:58:25,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:58:25,361 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 133 transitions. [2024-10-11 08:58:25,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:58:25,362 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 133 transitions. [2024-10-11 08:58:25,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:58:25,367 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:25,367 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:25,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 08:58:25,368 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:25,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:25,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1225124885, now seen corresponding path program 1 times [2024-10-11 08:58:25,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:25,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355578144] [2024-10-11 08:58:25,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:25,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:25,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:58:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:58:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:58:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:58:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:58:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 08:58:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:58:25,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:58:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:58:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:58:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:58:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:58:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:58:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:58:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:58:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:58:25,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:58:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:58:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:58:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:58:25,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:58:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:58:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:58:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:58:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:58:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:58:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:58:25,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:58:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:58:25,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:25,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:58:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:58:25,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355578144] [2024-10-11 08:58:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355578144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:58:25,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:58:25,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:58:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631786227] [2024-10-11 08:58:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:58:25,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:58:25,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:58:25,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:58:25,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:58:25,734 INFO L87 Difference]: Start difference. First operand 87 states and 133 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:58:25,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:58:25,824 INFO L93 Difference]: Finished difference Result 222 states and 337 transitions. [2024-10-11 08:58:25,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:58:25,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-11 08:58:25,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:58:25,828 INFO L225 Difference]: With dead ends: 222 [2024-10-11 08:58:25,828 INFO L226 Difference]: Without dead ends: 136 [2024-10-11 08:58:25,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:58:25,830 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 52 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 08:58:25,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 263 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 08:58:25,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-11 08:58:25,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-10-11 08:58:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 93 states have internal predecessors, (123), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:58:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 199 transitions. [2024-10-11 08:58:25,851 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 199 transitions. Word has length 187 [2024-10-11 08:58:25,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:58:25,852 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 199 transitions. [2024-10-11 08:58:25,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:58:25,852 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 199 transitions. [2024-10-11 08:58:25,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:58:25,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:25,855 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:25,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 08:58:25,856 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:25,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:25,857 INFO L85 PathProgramCache]: Analyzing trace with hash 549882477, now seen corresponding path program 1 times [2024-10-11 08:58:25,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:25,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210284892] [2024-10-11 08:58:25,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:25,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:58:26,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:58:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:58:26,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:58:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:58:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 08:58:26,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:58:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:58:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:58:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:58:26,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:58:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:58:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:58:26,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:58:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:58:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:58:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:58:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:58:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:58:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:58:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:58:26,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:58:26,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:58:26,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:58:26,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:58:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:58:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:58:26,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:58:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:58:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:58:26,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:58:26,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210284892] [2024-10-11 08:58:26,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210284892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:58:26,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:58:26,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 08:58:26,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18474996] [2024-10-11 08:58:26,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:58:26,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 08:58:26,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:58:26,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 08:58:26,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:58:26,237 INFO L87 Difference]: Start difference. First operand 133 states and 199 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:58:26,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:58:26,461 INFO L93 Difference]: Finished difference Result 310 states and 456 transitions. [2024-10-11 08:58:26,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 08:58:26,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-11 08:58:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:58:26,469 INFO L225 Difference]: With dead ends: 310 [2024-10-11 08:58:26,469 INFO L226 Difference]: Without dead ends: 178 [2024-10-11 08:58:26,471 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 08:58:26,472 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 115 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 08:58:26,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 375 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 08:58:26,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-11 08:58:26,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 133. [2024-10-11 08:58:26,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 92 states have (on average 1.326086956521739) internal successors, (122), 93 states have internal predecessors, (122), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:58:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2024-10-11 08:58:26,515 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 187 [2024-10-11 08:58:26,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:58:26,518 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2024-10-11 08:58:26,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:58:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2024-10-11 08:58:26,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:58:26,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:26,522 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:26,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 08:58:26,526 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:26,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:26,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1038465425, now seen corresponding path program 1 times [2024-10-11 08:58:26,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:26,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049498534] [2024-10-11 08:58:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:26,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:26,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:58:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:58:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:58:26,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:58:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:58:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 08:58:26,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:58:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:58:26,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:58:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:58:26,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:58:26,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:58:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:58:26,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:58:26,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:58:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:58:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:58:26,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:58:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:58:26,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:58:26,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:58:26,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:58:26,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:58:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:58:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:58:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:58:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:58:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:58:26,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:58:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:26,996 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 08:58:26,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:58:26,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049498534] [2024-10-11 08:58:26,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049498534] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:58:26,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331445125] [2024-10-11 08:58:26,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:26,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:58:26,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:58:27,000 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:58:27,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 08:58:27,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:27,162 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-11 08:58:27,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:58:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-11 08:58:27,502 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:58:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 08:58:27,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331445125] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:58:27,820 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:58:27,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-10-11 08:58:27,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723770757] [2024-10-11 08:58:27,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:58:27,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 08:58:27,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:58:27,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 08:58:27,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-11 08:58:27,825 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-10-11 08:58:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:58:28,239 INFO L93 Difference]: Finished difference Result 345 states and 494 transitions. [2024-10-11 08:58:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 08:58:28,240 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) Word has length 187 [2024-10-11 08:58:28,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:58:28,243 INFO L225 Difference]: With dead ends: 345 [2024-10-11 08:58:28,244 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 08:58:28,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 427 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2024-10-11 08:58:28,246 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 149 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:58:28,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 325 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 08:58:28,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 08:58:28,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 166. [2024-10-11 08:58:28,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 124 states have internal predecessors, (157), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:58:28,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 233 transitions. [2024-10-11 08:58:28,275 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 233 transitions. Word has length 187 [2024-10-11 08:58:28,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:58:28,276 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 233 transitions. [2024-10-11 08:58:28,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 2 states have call successors, (55), 2 states have call predecessors, (55), 4 states have return successors, (56), 2 states have call predecessors, (56), 2 states have call successors, (56) [2024-10-11 08:58:28,276 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 233 transitions. [2024-10-11 08:58:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:58:28,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:28,279 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:28,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 08:58:28,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:58:28,481 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:28,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:28,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1013935407, now seen corresponding path program 1 times [2024-10-11 08:58:28,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:28,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263730099] [2024-10-11 08:58:28,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:28,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:58:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:58:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:58:28,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:58:28,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:58:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 08:58:28,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:58:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:58:28,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:58:28,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:58:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:58:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:58:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:58:28,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:58:28,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:58:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:58:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:58:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:58:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:58:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:58:28,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:58:28,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:58:28,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:58:28,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:58:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:58:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:58:28,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:58:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:58:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:58:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:28,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:58:28,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:58:28,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263730099] [2024-10-11 08:58:28,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263730099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:58:28,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:58:28,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:58:28,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50281954] [2024-10-11 08:58:28,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:58:28,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:58:28,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:58:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:58:28,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:58:28,636 INFO L87 Difference]: Start difference. First operand 166 states and 233 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:58:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:58:28,688 INFO L93 Difference]: Finished difference Result 439 states and 604 transitions. [2024-10-11 08:58:28,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:58:28,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 187 [2024-10-11 08:58:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:58:28,695 INFO L225 Difference]: With dead ends: 439 [2024-10-11 08:58:28,695 INFO L226 Difference]: Without dead ends: 274 [2024-10-11 08:58:28,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:58:28,696 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 73 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 08:58:28,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 274 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 08:58:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-10-11 08:58:28,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2024-10-11 08:58:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 202 states have (on average 1.2326732673267327) internal successors, (249), 205 states have internal predecessors, (249), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 08:58:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 369 transitions. [2024-10-11 08:58:28,734 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 369 transitions. Word has length 187 [2024-10-11 08:58:28,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:58:28,735 INFO L471 AbstractCegarLoop]: Abstraction has 271 states and 369 transitions. [2024-10-11 08:58:28,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:58:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 369 transitions. [2024-10-11 08:58:28,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-10-11 08:58:28,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:28,738 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:28,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 08:58:28,739 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:28,739 INFO L85 PathProgramCache]: Analyzing trace with hash -7132947, now seen corresponding path program 1 times [2024-10-11 08:58:28,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852232927] [2024-10-11 08:58:28,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:28,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:28,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 08:58:29,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 08:58:29,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-10-11 08:58:29,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 08:58:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 08:58:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 08:58:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 08:58:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 08:58:29,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 08:58:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 08:58:29,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 08:58:29,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 08:58:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 08:58:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 08:58:29,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 08:58:29,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 08:58:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 08:58:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 08:58:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 08:58:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 08:58:29,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 08:58:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 08:58:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 08:58:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 08:58:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-10-11 08:58:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 08:58:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-11 08:58:29,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-11 08:58:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-11 08:58:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 08:58:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 08:58:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852232927] [2024-10-11 08:58:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852232927] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 08:58:29,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675305496] [2024-10-11 08:58:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:29,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:58:29,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:58:29,265 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:58:29,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 08:58:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:58:29,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 08:58:29,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:58:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 240 proven. 78 refuted. 0 times theorem prover too weak. 1306 trivial. 0 not checked. [2024-10-11 08:58:31,959 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 08:58:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 6 proven. 78 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 08:58:32,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675305496] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 08:58:32,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 08:58:32,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-11 08:58:32,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268973265] [2024-10-11 08:58:32,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 08:58:32,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 08:58:32,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 08:58:32,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 08:58:32,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=122, Unknown=6, NotChecked=0, Total=182 [2024-10-11 08:58:32,592 INFO L87 Difference]: Start difference. First operand 271 states and 369 transitions. Second operand has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-10-11 08:58:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:58:34,288 INFO L93 Difference]: Finished difference Result 549 states and 741 transitions. [2024-10-11 08:58:34,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 08:58:34,289 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) Word has length 187 [2024-10-11 08:58:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:58:34,295 INFO L225 Difference]: With dead ends: 549 [2024-10-11 08:58:34,295 INFO L226 Difference]: Without dead ends: 279 [2024-10-11 08:58:34,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 445 GetRequests, 425 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=145, Invalid=305, Unknown=12, NotChecked=0, Total=462 [2024-10-11 08:58:34,298 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 113 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 41 mSolverCounterUnsat, 124 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 124 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 08:58:34,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 172 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 239 Invalid, 124 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 08:58:34,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-10-11 08:58:34,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 237. [2024-10-11 08:58:34,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 168 states have (on average 1.2202380952380953) internal successors, (205), 171 states have internal predecessors, (205), 60 states have call successors, (60), 8 states have call predecessors, (60), 8 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-11 08:58:34,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2024-10-11 08:58:34,343 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 187 [2024-10-11 08:58:34,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:58:34,344 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2024-10-11 08:58:34,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.615384615384615) internal successors, (99), 14 states have internal predecessors, (99), 4 states have call successors, (84), 2 states have call predecessors, (84), 4 states have return successors, (85), 4 states have call predecessors, (85), 4 states have call successors, (85) [2024-10-11 08:58:34,345 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2024-10-11 08:58:34,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-10-11 08:58:34,348 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:58:34,348 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:34,368 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 08:58:34,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:58:34,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:58:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:58:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1924152158, now seen corresponding path program 1 times [2024-10-11 08:58:34,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 08:58:34,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186519838] [2024-10-11 08:58:34,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 08:58:34,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 08:58:34,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868744405] [2024-10-11 08:58:34,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:58:34,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:58:34,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:58:34,643 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 08:58:34,644 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 08:58:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:58:34,838 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 08:58:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 08:58:35,017 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 08:58:35,018 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 08:58:35,019 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 08:58:35,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 08:58:35,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 08:58:35,224 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:58:35,361 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 08:58:35,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 08:58:35 BoogieIcfgContainer [2024-10-11 08:58:35,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 08:58:35,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 08:58:35,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 08:58:35,365 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 08:58:35,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:58:24" (3/4) ... [2024-10-11 08:58:35,368 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 08:58:35,369 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 08:58:35,369 INFO L158 Benchmark]: Toolchain (without parser) took 11974.30ms. Allocated memory was 157.3MB in the beginning and 308.3MB in the end (delta: 151.0MB). Free memory was 81.7MB in the beginning and 179.0MB in the end (delta: -97.2MB). Peak memory consumption was 55.4MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,371 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 157.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 08:58:35,371 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.15ms. Allocated memory is still 157.3MB. Free memory was 81.5MB in the beginning and 64.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,371 INFO L158 Benchmark]: Boogie Procedure Inliner took 99.98ms. Allocated memory is still 157.3MB. Free memory was 64.9MB in the beginning and 127.6MB in the end (delta: -62.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,372 INFO L158 Benchmark]: Boogie Preprocessor took 87.85ms. Allocated memory is still 157.3MB. Free memory was 127.6MB in the beginning and 123.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,372 INFO L158 Benchmark]: RCFGBuilder took 574.75ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 95.1MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,372 INFO L158 Benchmark]: TraceAbstraction took 10823.35ms. Allocated memory was 157.3MB in the beginning and 308.3MB in the end (delta: 151.0MB). Free memory was 94.4MB in the beginning and 180.0MB in the end (delta: -85.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,373 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 308.3MB. Free memory was 180.0MB in the beginning and 179.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 08:58:35,374 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.21ms. Allocated memory is still 157.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.15ms. Allocated memory is still 157.3MB. Free memory was 81.5MB in the beginning and 64.9MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 99.98ms. Allocated memory is still 157.3MB. Free memory was 64.9MB in the beginning and 127.6MB in the end (delta: -62.7MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.85ms. Allocated memory is still 157.3MB. Free memory was 127.6MB in the beginning and 123.1MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 574.75ms. Allocated memory is still 157.3MB. Free memory was 123.1MB in the beginning and 95.1MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10823.35ms. Allocated memory was 157.3MB in the beginning and 308.3MB in the end (delta: 151.0MB). Free memory was 94.4MB in the beginning and 180.0MB in the end (delta: -85.6MB). Peak memory consumption was 66.1MB. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 308.3MB. Free memory was 180.0MB in the beginning and 179.0MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 175, overapproximation of shiftRight at line 110, overapproximation of someBinaryArithmeticDOUBLEoperation at line 122, overapproximation of someUnaryDOUBLEoperation at line 107, overapproximation of someBinaryDOUBLEComparisonOperation at line 175. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.25; [L23] signed long int var_1_3 = -25; [L24] signed long int var_1_4 = -128; [L25] double var_1_6 = 2.75; [L26] double var_1_7 = 24.5; [L27] double var_1_8 = 199.5; [L28] float var_1_9 = 32.8; [L29] unsigned char var_1_10 = 1; [L30] float var_1_11 = 15.4; [L31] float var_1_12 = 0.0; [L32] unsigned long int var_1_13 = 2; [L33] float var_1_16 = 127.6; [L34] signed long int var_1_17 = 128; [L35] unsigned char var_1_19 = 10; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_21 = 64; [L38] double var_1_22 = 15.95; [L39] unsigned long int var_1_23 = 4127848294; [L40] unsigned long int var_1_24 = 256; [L41] unsigned char var_1_27 = 1; [L42] unsigned char var_1_29 = 1; [L43] unsigned char var_1_30 = 0; [L44] unsigned char var_1_31 = 1; [L45] double var_1_32 = 32.7; [L46] unsigned char var_1_34 = 1; [L47] unsigned long int var_1_35 = 1000; [L48] signed char var_1_39 = -32; [L49] signed char var_1_40 = 16; [L50] signed char var_1_41 = 4; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_43 = 0; [L53] float var_1_44 = 99999999999.2; [L179] isInitial = 1 [L180] FCALL initially() [L181] COND TRUE 1 [L182] FCALL updateLastVariables() [L183] CALL updateVariables() [L126] var_1_3 = __VERIFIER_nondet_long() [L127] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L127] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L128] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] CALL assume_abort_if_not(var_1_3 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L129] RET assume_abort_if_not(var_1_3 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=-128, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L130] var_1_4 = __VERIFIER_nondet_long() [L131] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L131] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L132] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L133] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_6=11/4, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L134] var_1_6 = __VERIFIER_nondet_double() [L135] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L135] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=49/2, var_1_8=399/2, var_1_9=164/5] [L136] var_1_7 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L137] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_8=399/2, var_1_9=164/5] [L138] var_1_8 = __VERIFIER_nondet_double() [L139] CALL assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L139] RET assume_abort_if_not((var_1_8 >= 0.0F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 4611686.018427382800e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L140] var_1_10 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L141] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L142] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=77/5, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L143] var_1_11 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L144] RET assume_abort_if_not((var_1_11 >= -230584.3009213691390e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 2305843.009213691390e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_12=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L145] var_1_12 = __VERIFIER_nondet_float() [L146] CALL assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L146] RET assume_abort_if_not((var_1_12 >= 4611686.018427382800e+12F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=0, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L147] var_1_20 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L148] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L149] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=64, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L150] var_1_21 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L151] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L152] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=4127848294, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L153] var_1_23 = __VERIFIER_nondet_ulong() [L154] CALL assume_abort_if_not(var_1_23 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L154] RET assume_abort_if_not(var_1_23 >= 2147483647) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] CALL assume_abort_if_not(var_1_23 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L155] RET assume_abort_if_not(var_1_23 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L156] var_1_29 = __VERIFIER_nondet_uchar() [L157] CALL assume_abort_if_not(var_1_29 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L157] RET assume_abort_if_not(var_1_29 >= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] CALL assume_abort_if_not(var_1_29 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L158] RET assume_abort_if_not(var_1_29 <= 1) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L159] var_1_30 = __VERIFIER_nondet_uchar() [L160] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L160] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] CALL assume_abort_if_not(var_1_30 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L161] RET assume_abort_if_not(var_1_30 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=16, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L162] var_1_40 = __VERIFIER_nondet_char() [L163] CALL assume_abort_if_not(var_1_40 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L163] RET assume_abort_if_not(var_1_40 >= -63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] CALL assume_abort_if_not(var_1_40 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L164] RET assume_abort_if_not(var_1_40 <= 63) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=4, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L165] var_1_41 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_41 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L166] RET assume_abort_if_not(var_1_41 >= -127) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] CALL assume_abort_if_not(var_1_41 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L167] RET assume_abort_if_not(var_1_41 <= 126) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L168] var_1_43 = __VERIFIER_nondet_uchar() [L169] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L169] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] CALL assume_abort_if_not(var_1_43 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L170] RET assume_abort_if_not(var_1_43 <= 0) VAL [isInitial=1, var_1_10=0, var_1_13=2, var_1_16=638/5, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_9=164/5] [L183] RET updateVariables() [L184] CALL step() [L57] COND TRUE var_1_12 <= (var_1_7 * 5.8f) [L58] var_1_16 = ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=10, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L62] COND TRUE var_1_10 || var_1_20 [L63] var_1_19 = ((((var_1_21) > (32)) ? (var_1_21) : (32))) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L65] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L70] signed long int stepLocal_0 = (var_1_3 % var_1_4) * var_1_19; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_1=21/4, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L71] COND TRUE var_1_19 > stepLocal_0 [L72] var_1_1 = (var_1_6 - (var_1_7 + var_1_8)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=2, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L76] COND TRUE ! var_1_10 [L77] var_1_13 = (50u + var_1_19) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L81] COND FALSE !(var_1_8 < (var_1_22 / var_1_12)) VAL [isInitial=1, var_1_10=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=164/5] [L86] COND FALSE !(var_1_10 || (var_1_19 == var_1_13)) [L89] var_1_9 = ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=256, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L91] COND TRUE \read(var_1_20) [L92] var_1_24 = ((((((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (64u)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (64u)))) > (32u)) ? (((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (64u)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (64u)))) : (32u))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L94] COND FALSE !(var_1_19 <= 32u) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=1, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L99] COND TRUE (~ var_1_19) < var_1_19 [L100] var_1_27 = 0 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=1, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L105] var_1_31 = var_1_30 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=327/10, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L106] COND TRUE var_1_19 <= var_1_19 [L107] var_1_32 = (((((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) < 0 ) ? -((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))) : ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L109] var_1_34 = (! (var_1_10 && var_1_30)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L110] EXPR var_1_3 >> var_1_19 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L110] COND FALSE !(((var_1_3 >> var_1_19) % -10) >= var_1_19) [L115] COND FALSE !(-32 >= var_1_19) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L118] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_44=499999999996/5, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L121] COND TRUE var_1_12 < ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))) [L122] var_1_44 = (var_1_8 + var_1_11) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L184] RET step() [L185] CALL, EXPR property() [L175] EXPR (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L175-L176] return (((((((var_1_19 > ((var_1_3 % var_1_4) * var_1_19)) ? (var_1_1 == ((double) (var_1_6 - (var_1_7 + var_1_8)))) : (var_1_1 == ((double) (var_1_6 - (var_1_8 + var_1_7))))) && ((var_1_10 || (var_1_19 == var_1_13)) ? (var_1_9 == ((float) ((127.5f - ((((var_1_8) > (var_1_7)) ? (var_1_8) : (var_1_7)))) + (16.1f + var_1_11)))) : (var_1_9 == ((float) ((((((var_1_12 - var_1_7) - var_1_6)) < (var_1_11)) ? (((var_1_12 - var_1_7) - var_1_6)) : (var_1_11))))))) && ((! var_1_10) ? (var_1_13 == ((unsigned long int) (50u + var_1_19))) : (var_1_13 == ((unsigned long int) (var_1_19 + var_1_19))))) && ((var_1_12 <= (var_1_7 * 5.8f)) ? (var_1_16 == ((float) ((((((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) < (var_1_8)) ? (((((var_1_12) > (var_1_7)) ? (var_1_12) : (var_1_7)))) : (var_1_8))))) : (var_1_16 == ((float) var_1_6)))) && ((var_1_8 < (var_1_22 / var_1_12)) ? ((var_1_22 > var_1_6) ? (var_1_17 == ((signed long int) var_1_19)) : 1) : 1)) && ((var_1_10 || var_1_20) ? (var_1_19 == ((unsigned char) ((((var_1_21) > (32)) ? (var_1_21) : (32))))) : 1)) && (var_1_10 ? (((var_1_19 | var_1_19) != (var_1_23 - var_1_19)) ? (var_1_22 == ((double) 4.75)) : 1) : 1) ; [L185] RET, EXPR property() [L185] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=2, var_1_13=84, var_1_16=2, var_1_17=128, var_1_19=34, var_1_20=1, var_1_21=-478, var_1_22=319/20, var_1_23=2147483647, var_1_24=34, var_1_27=0, var_1_29=1, var_1_30=0, var_1_31=0, var_1_32=4, var_1_34=1, var_1_35=1000, var_1_39=-32, var_1_3=3, var_1_40=-63, var_1_41=-127, var_1_42=0, var_1_43=0, var_1_4=3, var_1_7=0, var_1_8=0, var_1_9=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.6s, OverallIterations: 7, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 124 mSolverCounterUnknown, 504 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 502 mSDsluCounter, 1539 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 796 mSDsCounter, 71 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 788 IncrementalHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 71 mSolverCounterUnsat, 743 mSDtfsCounter, 788 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1158 GetRequests, 1122 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=271occurred in iteration=5, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 140 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1872 NumberOfCodeBlocks, 1872 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1860 ConstructedInterpolants, 11 QuantifiedInterpolants, 6225 SizeOfPredicates, 6 NumberOfNonLiveVariables, 837 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 15772/16240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 08:58:35,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 08:58:37,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 08:58:37,644 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 08:58:37,648 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 08:58:37,650 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 08:58:37,677 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 08:58:37,680 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 08:58:37,680 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 08:58:37,680 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 08:58:37,681 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 08:58:37,681 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 08:58:37,682 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 08:58:37,682 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 08:58:37,683 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 08:58:37,684 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 08:58:37,685 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 08:58:37,685 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 08:58:37,685 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 08:58:37,686 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 08:58:37,686 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 08:58:37,686 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 08:58:37,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 08:58:37,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 08:58:37,690 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 08:58:37,690 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 08:58:37,691 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 08:58:37,691 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 08:58:37,691 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 08:58:37,691 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 08:58:37,691 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 08:58:37,692 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 08:58:37,692 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 08:58:37,692 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 08:58:37,692 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 08:58:37,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:58:37,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 08:58:37,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 08:58:37,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 08:58:37,705 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 08:58:37,706 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 08:58:37,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 08:58:37,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 08:58:37,706 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 08:58:37,707 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 08:58:37,707 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 08:58:37,707 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d2d49c0a5e75da8ae49630f3d5e91c2d1a9c3582cbe11ea11cc5a687ad347724 [2024-10-11 08:58:38,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 08:58:38,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 08:58:38,033 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 08:58:38,034 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 08:58:38,035 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 08:58:38,037 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-10-11 08:58:39,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 08:58:39,759 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 08:58:39,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-10-11 08:58:39,768 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/916bfa125/5b25d7a2c3c147b28e4a5739be3e7fa7/FLAG9492e47e9 [2024-10-11 08:58:39,779 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/916bfa125/5b25d7a2c3c147b28e4a5739be3e7fa7 [2024-10-11 08:58:39,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 08:58:39,783 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 08:58:39,784 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 08:58:39,785 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 08:58:39,789 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 08:58:39,790 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:58:39" (1/1) ... [2024-10-11 08:58:39,791 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69e99512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:39, skipping insertion in model container [2024-10-11 08:58:39,791 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 08:58:39" (1/1) ... [2024-10-11 08:58:39,833 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 08:58:40,025 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i[919,932] [2024-10-11 08:58:40,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:58:40,133 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 08:58:40,147 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i[919,932] [2024-10-11 08:58:40,190 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 08:58:40,216 INFO L204 MainTranslator]: Completed translation [2024-10-11 08:58:40,216 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40 WrapperNode [2024-10-11 08:58:40,217 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 08:58:40,218 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 08:58:40,218 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 08:58:40,218 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 08:58:40,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,245 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,285 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-10-11 08:58:40,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 08:58:40,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 08:58:40,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 08:58:40,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 08:58:40,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,300 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,303 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,341 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 08:58:40,343 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,344 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,371 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 08:58:40,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 08:58:40,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 08:58:40,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 08:58:40,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (1/1) ... [2024-10-11 08:58:40,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 08:58:40,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 08:58:40,410 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 08:58:40,412 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 08:58:40,450 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 08:58:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 08:58:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 08:58:40,451 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 08:58:40,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 08:58:40,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 08:58:40,537 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 08:58:40,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 08:59:10,860 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-11 08:59:10,860 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 08:59:10,908 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 08:59:10,908 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 08:59:10,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:10 BoogieIcfgContainer [2024-10-11 08:59:10,909 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 08:59:10,913 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 08:59:10,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 08:59:10,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 08:59:10,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 08:58:39" (1/3) ... [2024-10-11 08:59:10,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68944355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:59:10, skipping insertion in model container [2024-10-11 08:59:10,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 08:58:40" (2/3) ... [2024-10-11 08:59:10,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68944355 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 08:59:10, skipping insertion in model container [2024-10-11 08:59:10,921 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 08:59:10" (3/3) ... [2024-10-11 08:59:10,923 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-62.i [2024-10-11 08:59:10,945 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 08:59:10,945 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 08:59:11,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 08:59:11,033 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;@132389ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 08:59:11,034 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 08:59:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:59:11,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 08:59:11,057 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:59:11,059 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:59:11,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:59:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:59:11,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1240988896, now seen corresponding path program 1 times [2024-10-11 08:59:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:59:11,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1510109174] [2024-10-11 08:59:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:59:11,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:59:11,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:59:11,087 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:59:11,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 08:59:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:59:12,511 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 08:59:12,525 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:59:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 804 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2024-10-11 08:59:12,586 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:59:12,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:59:12,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1510109174] [2024-10-11 08:59:12,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1510109174] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:59:12,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:59:12,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 08:59:12,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823076338] [2024-10-11 08:59:12,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:59:12,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 08:59:12,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:59:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 08:59:12,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:59:12,620 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.5) internal successors, (72), 49 states have internal predecessors, (72), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:59:17,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:17,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:59:17,228 INFO L93 Difference]: Finished difference Result 157 states and 287 transitions. [2024-10-11 08:59:17,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 08:59:17,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 184 [2024-10-11 08:59:17,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:59:17,417 INFO L225 Difference]: With dead ends: 157 [2024-10-11 08:59:17,417 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 08:59:17,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 183 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 08:59:17,425 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-11 08:59:17,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-11 08:59:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 08:59:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 08:59:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 08:59:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-11 08:59:17,492 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 184 [2024-10-11 08:59:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:59:17,493 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-11 08:59:17,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 08:59:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-11 08:59:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 08:59:17,500 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:59:17,500 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:59:17,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 08:59:17,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:59:17,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:59:17,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:59:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash -410479914, now seen corresponding path program 1 times [2024-10-11 08:59:17,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:59:17,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795344621] [2024-10-11 08:59:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:59:17,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:59:17,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:59:17,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:59:17,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 08:59:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:59:19,207 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 08:59:19,214 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 08:59:19,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 08:59:19,473 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 08:59:19,473 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 08:59:19,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [795344621] [2024-10-11 08:59:19,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [795344621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 08:59:19,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 08:59:19,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 08:59:19,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713925020] [2024-10-11 08:59:19,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 08:59:19,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 08:59:19,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 08:59:19,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 08:59:19,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:59:19,479 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:59:23,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:27,995 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:32,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:36,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:40,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:44,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 08:59:45,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 08:59:45,058 INFO L93 Difference]: Finished difference Result 198 states and 304 transitions. [2024-10-11 08:59:45,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 08:59:45,059 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 184 [2024-10-11 08:59:45,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 08:59:45,067 INFO L225 Difference]: With dead ends: 198 [2024-10-11 08:59:45,067 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 08:59:45,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 08:59:45,071 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 56 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 6 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.5s IncrementalHoareTripleChecker+Time [2024-10-11 08:59:45,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 245 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 18 Invalid, 6 Unknown, 0 Unchecked, 25.5s Time] [2024-10-11 08:59:45,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 08:59:45,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2024-10-11 08:59:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 77 states have (on average 1.3376623376623376) internal successors, (103), 78 states have internal predecessors, (103), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-10-11 08:59:45,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 179 transitions. [2024-10-11 08:59:45,108 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 179 transitions. Word has length 184 [2024-10-11 08:59:45,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 08:59:45,109 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 179 transitions. [2024-10-11 08:59:45,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 08:59:45,109 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 179 transitions. [2024-10-11 08:59:45,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 08:59:45,115 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 08:59:45,115 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 08:59:45,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 08:59:45,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:59:45,316 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 08:59:45,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 08:59:45,317 INFO L85 PathProgramCache]: Analyzing trace with hash 612435482, now seen corresponding path program 1 times [2024-10-11 08:59:45,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 08:59:45,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382203974] [2024-10-11 08:59:45,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 08:59:45,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 08:59:45,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 08:59:45,321 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 08:59:45,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 08:59:48,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 08:59:48,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 08:59:48,256 INFO L278 TraceCheckSpWp]: Computing forward predicates...