./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-ps-ci_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:00:27,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:00:27,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 10:00:27,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:00:27,542 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:00:27,569 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:00:27,571 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:00:27,572 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:00:27,572 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:00:27,574 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:00:27,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:00:27,574 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:00:27,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:00:27,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:00:27,578 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:00:27,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:00:27,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:00:27,579 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:00:27,579 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 10:00:27,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:00:27,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:00:27,584 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:00:27,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:00:27,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:00:27,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:00:27,585 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:00:27,585 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:00:27,585 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:00:27,586 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:00:27,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:00:27,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:00:27,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:00:27,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:00:27,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:00:27,587 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:00:27,587 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:00:27,587 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 10:00:27,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 10:00:27,587 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:00:27,587 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:00:27,588 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:00:27,590 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:00:27,590 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 -> 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b [2024-10-11 10:00:27,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:00:27,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:00:27,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:00:27,856 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:00:27,856 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:00:27,858 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-11 10:00:29,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:00:29,470 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:00:29,472 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-11 10:00:29,489 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3933c6fa8/22832dc5d6604f9189398fbd7b3eebf6/FLAGe74c4755a [2024-10-11 10:00:29,504 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3933c6fa8/22832dc5d6604f9189398fbd7b3eebf6 [2024-10-11 10:00:29,507 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:00:29,509 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:00:29,512 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:00:29,512 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:00:29,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:00:29,517 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:29,518 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e035b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29, skipping insertion in model container [2024-10-11 10:00:29,518 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:29,547 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:00:29,700 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-ps-ci_file-35.i[919,932] [2024-10-11 10:00:29,791 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:00:29,810 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:00:29,822 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-ps-ci_file-35.i[919,932] [2024-10-11 10:00:29,915 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:00:29,979 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:00:29,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29 WrapperNode [2024-10-11 10:00:29,982 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:00:29,982 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:00:29,983 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:00:29,984 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:00:29,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,042 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 243 [2024-10-11 10:00:30,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:00:30,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:00:30,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:00:30,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:00:30,067 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,068 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,075 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,098 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 10:00:30,098 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,099 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,106 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,110 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,112 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,114 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:00:30,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:00:30,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:00:30,118 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:00:30,119 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (1/1) ... [2024-10-11 10:00:30,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:00:30,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:00:30,165 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 10:00:30,168 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 10:00:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:00:30,204 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:00:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:00:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 10:00:30,205 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:00:30,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:00:30,294 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:00:30,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:00:30,637 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-11 10:00:30,638 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:00:30,685 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:00:30,685 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:00:30,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:00:30 BoogieIcfgContainer [2024-10-11 10:00:30,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:00:30,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:00:30,687 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:00:30,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:00:30,695 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:00:29" (1/3) ... [2024-10-11 10:00:30,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f51cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:00:30, skipping insertion in model container [2024-10-11 10:00:30,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:29" (2/3) ... [2024-10-11 10:00:30,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55f51cee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:00:30, skipping insertion in model container [2024-10-11 10:00:30,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:00:30" (3/3) ... [2024-10-11 10:00:30,697 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-11 10:00:30,711 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:00:30,711 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:00:30,772 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:00:30,778 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;@6e946cd2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:00:30,779 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:00:30,784 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:00:30,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-11 10:00:30,797 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:30,798 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:30,798 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:30,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1471081478, now seen corresponding path program 1 times [2024-10-11 10:00:30,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:00:30,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66409849] [2024-10-11 10:00:30,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:30,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:00:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:00:31,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:00:31,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:00:31,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:00:31,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:00:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:00:31,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:00:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:00:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:00:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:00:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:00:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:00:31,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:00:31,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:00:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 10:00:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:00:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 10:00:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:00:31,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 10:00:31,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:00:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 10:00:31,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:00:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:00:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:00:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 10:00:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:00:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 10:00:31,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:00:31,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:31,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:31,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:00:31,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66409849] [2024-10-11 10:00:31,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66409849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:31,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:31,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:00:31,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405171854] [2024-10-11 10:00:31,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:31,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:00:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:00:31,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:00:31,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:00:31,622 INFO L87 Difference]: Start difference. First operand has 94 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:31,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:31,931 INFO L93 Difference]: Finished difference Result 293 states and 521 transitions. [2024-10-11 10:00:31,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:00:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-10-11 10:00:31,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:31,945 INFO L225 Difference]: With dead ends: 293 [2024-10-11 10:00:31,945 INFO L226 Difference]: Without dead ends: 200 [2024-10-11 10:00:31,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:00:31,954 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 134 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:31,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 505 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:00:31,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-10-11 10:00:32,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 179. [2024-10-11 10:00:32,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 120 states have (on average 1.375) internal successors, (165), 120 states have internal predecessors, (165), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 10:00:32,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 277 transitions. [2024-10-11 10:00:32,035 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 277 transitions. Word has length 184 [2024-10-11 10:00:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:32,036 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 277 transitions. [2024-10-11 10:00:32,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 277 transitions. [2024-10-11 10:00:32,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:00:32,039 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:32,039 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:32,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 10:00:32,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:32,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:32,041 INFO L85 PathProgramCache]: Analyzing trace with hash -498222247, now seen corresponding path program 1 times [2024-10-11 10:00:32,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:00:32,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723435592] [2024-10-11 10:00:32,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:32,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:00:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:00:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:00:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:00:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:00:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:00:32,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:00:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:00:32,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:00:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:00:32,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:00:32,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:00:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:00:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:00:32,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:00:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 10:00:32,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:00:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 10:00:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:00:32,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 10:00:32,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:00:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 10:00:32,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:00:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:00:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:00:32,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 10:00:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:00:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 10:00:32,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:00:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:32,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:00:32,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723435592] [2024-10-11 10:00:32,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723435592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:32,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:32,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:00:32,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549682800] [2024-10-11 10:00:32,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:32,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:00:32,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:00:32,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:00:32,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:00:32,523 INFO L87 Difference]: Start difference. First operand 179 states and 277 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:32,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:32,667 INFO L93 Difference]: Finished difference Result 561 states and 864 transitions. [2024-10-11 10:00:32,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:00:32,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-10-11 10:00:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:32,671 INFO L225 Difference]: With dead ends: 561 [2024-10-11 10:00:32,671 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 10:00:32,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:00:32,673 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 137 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:32,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 420 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 10:00:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 10:00:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 355. [2024-10-11 10:00:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 355 states, 238 states have (on average 1.3697478991596639) internal successors, (326), 238 states have internal predecessors, (326), 112 states have call successors, (112), 4 states have call predecessors, (112), 4 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-11 10:00:32,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 550 transitions. [2024-10-11 10:00:32,737 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 550 transitions. Word has length 185 [2024-10-11 10:00:32,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:32,738 INFO L471 AbstractCegarLoop]: Abstraction has 355 states and 550 transitions. [2024-10-11 10:00:32,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:32,739 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 550 transitions. [2024-10-11 10:00:32,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:00:32,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:32,741 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:32,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 10:00:32,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:32,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:32,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1802600343, now seen corresponding path program 1 times [2024-10-11 10:00:32,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:00:32,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500376075] [2024-10-11 10:00:32,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:32,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:00:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:00:32,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:00:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:00:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:00:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:00:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:00:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:00:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:00:32,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:00:32,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:00:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:00:32,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:00:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:00:32,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:00:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 10:00:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:00:32,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 10:00:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:00:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 10:00:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:00:32,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 10:00:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:00:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:00:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:00:32,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 10:00:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:00:32,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:32,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 10:00:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:00:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:33,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:00:33,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500376075] [2024-10-11 10:00:33,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500376075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:33,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:33,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:00:33,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80312202] [2024-10-11 10:00:33,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:33,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:00:33,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:00:33,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:00:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:00:33,009 INFO L87 Difference]: Start difference. First operand 355 states and 550 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:33,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:33,302 INFO L93 Difference]: Finished difference Result 1249 states and 1929 transitions. [2024-10-11 10:00:33,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:00:33,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-10-11 10:00:33,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:33,309 INFO L225 Difference]: With dead ends: 1249 [2024-10-11 10:00:33,309 INFO L226 Difference]: Without dead ends: 895 [2024-10-11 10:00:33,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 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 10:00:33,312 INFO L432 NwaCegarLoop]: 266 mSDtfsCounter, 192 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:33,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 511 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:00:33,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2024-10-11 10:00:33,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 859. [2024-10-11 10:00:33,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 859 states, 594 states have (on average 1.3703703703703705) internal successors, (814), 598 states have internal predecessors, (814), 252 states have call successors, (252), 12 states have call predecessors, (252), 12 states have return successors, (252), 248 states have call predecessors, (252), 252 states have call successors, (252) [2024-10-11 10:00:33,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1318 transitions. [2024-10-11 10:00:33,413 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1318 transitions. Word has length 185 [2024-10-11 10:00:33,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:33,414 INFO L471 AbstractCegarLoop]: Abstraction has 859 states and 1318 transitions. [2024-10-11 10:00:33,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:33,414 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1318 transitions. [2024-10-11 10:00:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:00:33,416 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:33,416 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:33,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 10:00:33,417 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:33,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:33,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2060765781, now seen corresponding path program 1 times [2024-10-11 10:00:33,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:00:33,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051705479] [2024-10-11 10:00:33,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:33,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:00:33,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:00:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:00:33,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:00:33,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:00:33,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:00:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:00:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:00:33,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:00:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:00:33,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:00:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:00:33,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:00:33,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:00:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:00:33,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 10:00:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:00:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 10:00:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:00:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 10:00:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:00:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 10:00:33,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:00:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:00:33,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:00:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 10:00:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:00:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 10:00:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:00:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:33,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:33,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:00:33,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051705479] [2024-10-11 10:00:33,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051705479] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:33,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:33,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 10:00:33,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828881783] [2024-10-11 10:00:33,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:33,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:00:33,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:00:33,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:00:33,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:00:33,881 INFO L87 Difference]: Start difference. First operand 859 states and 1318 transitions. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:34,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:34,155 INFO L93 Difference]: Finished difference Result 1393 states and 2105 transitions. [2024-10-11 10:00:34,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:00:34,155 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-10-11 10:00:34,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:34,162 INFO L225 Difference]: With dead ends: 1393 [2024-10-11 10:00:34,162 INFO L226 Difference]: Without dead ends: 963 [2024-10-11 10:00:34,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:00:34,165 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 101 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:34,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 471 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:00:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-10-11 10:00:34,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 799. [2024-10-11 10:00:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 562 states have (on average 1.3772241992882561) internal successors, (774), 562 states have internal predecessors, (774), 224 states have call successors, (224), 12 states have call predecessors, (224), 12 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-11 10:00:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1222 transitions. [2024-10-11 10:00:34,248 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1222 transitions. Word has length 185 [2024-10-11 10:00:34,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:34,249 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1222 transitions. [2024-10-11 10:00:34,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:34,249 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1222 transitions. [2024-10-11 10:00:34,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:00:34,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:34,251 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:34,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 10:00:34,252 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:34,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:34,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1251419155, now seen corresponding path program 1 times [2024-10-11 10:00:34,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:00:34,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151573412] [2024-10-11 10:00:34,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:00:34,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 10:00:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 10:00:34,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 10:00:34,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 10:00:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 10:00:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 10:00:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 10:00:34,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 10:00:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 10:00:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 10:00:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 10:00:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 10:00:34,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 10:00:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 10:00:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 10:00:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 10:00:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 10:00:34,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 10:00:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 10:00:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 10:00:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 10:00:34,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 10:00:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 10:00:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 10:00:34,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-11 10:00:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-10-11 10:00:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-10-11 10:00:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-10-11 10:00:34,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 10:00:34,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 10:00:34,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151573412] [2024-10-11 10:00:34,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151573412] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 10:00:34,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643813356] [2024-10-11 10:00:34,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:34,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:00:34,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:00:34,446 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 10:00:34,447 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 10:00:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:34,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 443 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 10:00:34,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:00:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-11 10:00:34,873 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:00:35,378 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 10:00:35,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643813356] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:00:35,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 10:00:35,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-11 10:00:35,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413284834] [2024-10-11 10:00:35,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 10:00:35,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:00:35,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 10:00:35,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:00:35,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:00:35,403 INFO L87 Difference]: Start difference. First operand 799 states and 1222 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-10-11 10:00:35,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:35,692 INFO L93 Difference]: Finished difference Result 1653 states and 2491 transitions. [2024-10-11 10:00:35,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:00:35,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) Word has length 185 [2024-10-11 10:00:35,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:35,700 INFO L225 Difference]: With dead ends: 1653 [2024-10-11 10:00:35,702 INFO L226 Difference]: Without dead ends: 855 [2024-10-11 10:00:35,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:00:35,706 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 299 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:35,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 235 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 10:00:35,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-11 10:00:35,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 831. [2024-10-11 10:00:35,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 586 states have (on average 1.341296928327645) internal successors, (786), 586 states have internal predecessors, (786), 224 states have call successors, (224), 20 states have call predecessors, (224), 20 states have return successors, (224), 224 states have call predecessors, (224), 224 states have call successors, (224) [2024-10-11 10:00:35,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1234 transitions. [2024-10-11 10:00:35,797 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1234 transitions. Word has length 185 [2024-10-11 10:00:35,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:35,798 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1234 transitions. [2024-10-11 10:00:35,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 8 states have internal predecessors, (66), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 3 states have call predecessors, (47), 3 states have call successors, (47) [2024-10-11 10:00:35,799 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1234 transitions. [2024-10-11 10:00:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-10-11 10:00:35,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:35,801 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:35,817 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 10:00:36,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:00:36,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:36,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:36,003 INFO L85 PathProgramCache]: Analyzing trace with hash -554019179, now seen corresponding path program 1 times [2024-10-11 10:00:36,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 10:00:36,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339226336] [2024-10-11 10:00:36,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:36,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 10:00:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 10:00:36,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990594709] [2024-10-11 10:00:36,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:36,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 10:00:36,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:00:36,116 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 10:00:36,122 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 10:00:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:00:36,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 10:00:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 10:00:36,386 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 10:00:36,387 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 10:00:36,388 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 10:00:36,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 10:00:36,589 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 10:00:36,593 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 10:00:36,691 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 10:00:36,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 10:00:36 BoogieIcfgContainer [2024-10-11 10:00:36,694 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 10:00:36,695 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 10:00:36,695 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 10:00:36,695 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 10:00:36,695 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:00:30" (3/4) ... [2024-10-11 10:00:36,697 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 10:00:36,698 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 10:00:36,698 INFO L158 Benchmark]: Toolchain (without parser) took 7190.19ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 100.4MB in the beginning and 171.5MB in the end (delta: -71.1MB). Peak memory consumption was 140.0MB. Max. memory is 16.1GB. [2024-10-11 10:00:36,698 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 167.8MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:00:36,699 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.03ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 137.8MB in the end (delta: -37.6MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. [2024-10-11 10:00:36,699 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.74ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:00:36,699 INFO L158 Benchmark]: Boogie Preprocessor took 66.29ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 129.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 10:00:36,699 INFO L158 Benchmark]: RCFGBuilder took 567.84ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 97.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 10:00:36,699 INFO L158 Benchmark]: TraceAbstraction took 6007.31ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 96.7MB in the beginning and 171.5MB in the end (delta: -74.8MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2024-10-11 10:00:36,700 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 377.5MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 10:00:36,701 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.18ms. Allocated memory is still 167.8MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 470.03ms. Allocated memory is still 167.8MB. Free memory was 100.2MB in the beginning and 137.8MB in the end (delta: -37.6MB). Peak memory consumption was 19.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.74ms. Allocated memory is still 167.8MB. Free memory was 137.8MB in the beginning and 133.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.29ms. Allocated memory is still 167.8MB. Free memory was 133.6MB in the beginning and 129.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 567.84ms. Allocated memory is still 167.8MB. Free memory was 128.8MB in the beginning and 97.4MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6007.31ms. Allocated memory was 167.8MB in the beginning and 377.5MB in the end (delta: 209.7MB). Free memory was 96.7MB in the beginning and 171.5MB in the end (delta: -74.8MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 377.5MB. Free memory is still 171.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 191, overapproximation of someBinaryDOUBLEComparisonOperation at line 191, overapproximation of someUnaryFLOAToperation at line 125, overapproximation of someBinaryArithmeticFLOAToperation at line 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_3 = 1; [L24] unsigned char var_1_4 = 0; [L25] unsigned char var_1_5 = 0; [L26] unsigned short int var_1_6 = 25; [L27] double var_1_9 = 999.625; [L28] unsigned short int var_1_11 = 5; [L29] signed short int var_1_12 = 2; [L30] signed long int var_1_13 = -256; [L31] double var_1_14 = 127.75; [L32] double var_1_15 = 9.75; [L33] float var_1_16 = 32.8; [L34] float var_1_17 = 32.5; [L35] float var_1_18 = 1.75; [L36] float var_1_19 = 1000000000000000.4; [L37] float var_1_20 = 0.875; [L38] unsigned char var_1_21 = 0; [L39] unsigned char var_1_22 = 0; [L40] signed short int var_1_23 = 64; [L41] signed short int var_1_24 = 25; [L42] signed short int var_1_25 = 0; [L43] float var_1_26 = 128.2; [L44] signed long int var_1_28 = -100000; [L45] signed char var_1_30 = -25; [L46] signed char var_1_33 = 32; [L47] signed char var_1_34 = -4; [L48] unsigned long int var_1_35 = 1; [L49] double var_1_39 = 7.75; [L50] float var_1_41 = 255.2; [L51] unsigned char var_1_42 = 25; [L52] unsigned char var_1_43 = 64; [L53] unsigned char var_1_44 = 1; [L54] float var_1_45 = 255.5; [L55] float var_1_46 = 10.55; [L56] signed short int last_1_var_1_12 = 2; [L57] signed long int last_1_var_1_13 = -256; [L58] double last_1_var_1_14 = 127.75; [L59] unsigned char last_1_var_1_21 = 0; [L195] isInitial = 1 [L196] FCALL initially() [L197] COND TRUE 1 [L198] CALL updateLastVariables() [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_14 = var_1_14 [L188] last_1_var_1_21 = var_1_21 [L198] RET updateLastVariables() [L199] CALL updateVariables() [L138] var_1_3 = __VERIFIER_nondet_uchar() [L139] CALL assume_abort_if_not(var_1_3 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L139] RET assume_abort_if_not(var_1_3 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L140] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L141] var_1_4 = __VERIFIER_nondet_uchar() [L142] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L142] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L143] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=0, var_1_6=25, var_1_9=7997/8] [L144] var_1_5 = __VERIFIER_nondet_uchar() [L145] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L145] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L146] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L146] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25, var_1_9=7997/8] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L148] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=5, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L149] var_1_11 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L151] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_15=39/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L152] var_1_15 = __VERIFIER_nondet_double() [L153] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L153] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=65/2, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L154] var_1_17 = __VERIFIER_nondet_float() [L155] CALL assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L155] RET assume_abort_if_not((var_1_17 >= -230584.3009213691390e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 2305843.009213691390e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=7/4, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L156] var_1_18 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L157] RET assume_abort_if_not((var_1_18 >= -230584.3009213691390e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 2305843.009213691390e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_19=5000000000000002/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L158] var_1_19 = __VERIFIER_nondet_float() [L159] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L159] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_20=7/8, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L160] var_1_20 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L161] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=0, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L162] var_1_22 = __VERIFIER_nondet_uchar() [L163] CALL assume_abort_if_not(var_1_22 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L163] RET assume_abort_if_not(var_1_22 >= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] CALL assume_abort_if_not(var_1_22 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L164] RET assume_abort_if_not(var_1_22 <= 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=25, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L165] var_1_24 = __VERIFIER_nondet_short() [L166] CALL assume_abort_if_not(var_1_24 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L166] RET assume_abort_if_not(var_1_24 >= -1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] CALL assume_abort_if_not(var_1_24 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L167] RET assume_abort_if_not(var_1_24 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L168] var_1_25 = __VERIFIER_nondet_short() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] CALL assume_abort_if_not(var_1_25 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L170] RET assume_abort_if_not(var_1_25 <= 32766) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=32, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L171] var_1_33 = __VERIFIER_nondet_char() [L172] CALL assume_abort_if_not(var_1_33 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L172] RET assume_abort_if_not(var_1_33 >= -126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] CALL assume_abort_if_not(var_1_33 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L173] RET assume_abort_if_not(var_1_33 <= 126) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-4, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L174] var_1_34 = __VERIFIER_nondet_char() [L175] CALL assume_abort_if_not(var_1_34 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L175] RET assume_abort_if_not(var_1_34 >= -63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] CALL assume_abort_if_not(var_1_34 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L176] RET assume_abort_if_not(var_1_34 <= 63) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=64, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L177] var_1_43 = __VERIFIER_nondet_uchar() [L178] CALL assume_abort_if_not(var_1_43 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L178] RET assume_abort_if_not(var_1_43 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] CALL assume_abort_if_not(var_1_43 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L179] RET assume_abort_if_not(var_1_43 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L180] var_1_44 = __VERIFIER_nondet_uchar() [L181] CALL assume_abort_if_not(var_1_44 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L181] RET assume_abort_if_not(var_1_44 >= 0) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] CALL assume_abort_if_not(var_1_44 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L182] RET assume_abort_if_not(var_1_44 <= 254) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=641/5, var_1_28=-100000, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L199] RET updateVariables() [L200] CALL step() [L63] var_1_26 = var_1_18 [L64] var_1_28 = var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=-25, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L65] COND FALSE !(var_1_20 <= var_1_18) [L70] var_1_30 = (50 + var_1_34) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L72] COND FALSE !(! var_1_22) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L79] COND TRUE 32u >= (((((var_1_6) > (var_1_11)) ? (var_1_6) : (var_1_11))) % 16u) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=31/4, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L80] COND FALSE !((-5 > var_1_25) && (var_1_6 <= ((((var_1_34) > (var_1_12)) ? (var_1_34) : (var_1_12))))) [L83] var_1_39 = ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_1=1, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=1276/5, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L90] var_1_41 = ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) < (var_1_20)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (var_1_20))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L91] EXPR var_1_11 | var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=25, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L91] COND TRUE var_1_33 < (var_1_11 | var_1_6) [L92] var_1_42 = ((((var_1_43) < (var_1_44)) ? (var_1_43) : (var_1_44))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=511/2, var_1_46=211/20, var_1_4=0, var_1_5=1, var_1_6=25] [L94] var_1_45 = 2.71f [L95] var_1_46 = var_1_17 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L96] COND FALSE !(\read(last_1_var_1_21)) [L99] var_1_1 = (var_1_3 && var_1_5) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=64, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L101] COND FALSE !(var_1_18 > var_1_9) [L104] var_1_23 = (last_1_var_1_13 + 1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L106] signed long int stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_0=2, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L107] COND TRUE last_1_var_1_12 >= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=25] [L108] COND TRUE (var_1_9 - 1.00000000000025E12) >= last_1_var_1_14 [L109] var_1_6 = 200 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L116] unsigned short int stepLocal_1 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_1=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L117] COND FALSE !(var_1_11 > stepLocal_1) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L120] EXPR var_1_11 >> var_1_6 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=511/4, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L120] COND TRUE (var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12) [L121] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=164/5, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L125] var_1_16 = (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))))) [L126] unsigned short int stepLocal_3 = var_1_11; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_3=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L127] COND FALSE !(stepLocal_3 == var_1_6) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L130] unsigned short int stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, stepLocal_2=200, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L131] COND FALSE !(stepLocal_2 == var_1_12) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L200] RET step() [L201] CALL, EXPR property() [L191] EXPR ((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15))) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L191-L192] return (((((((last_1_var_1_21 ? (var_1_1 == ((unsigned char) ((! var_1_3) || var_1_4))) : (var_1_1 == ((unsigned char) (var_1_3 && var_1_5)))) && ((last_1_var_1_12 >= last_1_var_1_12) ? (((var_1_9 - 1.00000000000025E12) >= last_1_var_1_14) ? (var_1_6 == ((unsigned short int) 200)) : (var_1_6 == ((unsigned short int) var_1_11))) : (var_1_6 == ((unsigned short int) var_1_11)))) && ((var_1_11 > var_1_6) ? (var_1_12 == ((signed short int) 32)) : 1)) && ((var_1_6 == var_1_12) ? ((! var_1_3) ? (var_1_13 == ((signed long int) ((last_1_var_1_13 + var_1_6) + (var_1_11 - var_1_23)))) : 1) : 1)) && (((var_1_12 + var_1_23) < ((var_1_11 >> var_1_6) * var_1_12)) ? (var_1_14 == ((double) var_1_15)) : (var_1_14 == ((double) var_1_15)))) && (var_1_16 == ((float) (((((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) < 0 ) ? -((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20)))) : ((var_1_17 + var_1_18) + ((((var_1_19) < (var_1_20)) ? (var_1_19) : (var_1_20))))))))) && ((var_1_11 == var_1_6) ? (var_1_21 == ((unsigned char) ((var_1_5 || var_1_3) && (var_1_1 || var_1_22)))) : 1)) && ((var_1_18 > var_1_9) ? (var_1_23 == ((signed short int) (((((var_1_24 - var_1_25)) > (last_1_var_1_13)) ? ((var_1_24 - var_1_25)) : (last_1_var_1_13))))) : (var_1_23 == ((signed short int) (last_1_var_1_13 + 1)))) ; [L201] RET, EXPR property() [L201] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=2, last_1_var_1_13=-256, last_1_var_1_14=511/4, last_1_var_1_21=0, var_1_11=0, var_1_12=2, var_1_13=-256, var_1_14=6, var_1_15=6, var_1_16=7, var_1_17=5, var_1_18=2, var_1_19=0, var_1_1=1, var_1_20=0, var_1_21=0, var_1_22=1, var_1_23=-255, var_1_24=-1, var_1_25=0, var_1_26=2, var_1_28=25, var_1_30=0, var_1_33=24, var_1_34=-50, var_1_35=1, var_1_39=3, var_1_3=1, var_1_41=4, var_1_42=0, var_1_43=1, var_1_44=0, var_1_45=271/100, var_1_46=5, var_1_4=0, var_1_5=1, var_1_6=200] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.8s, OverallIterations: 6, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 881 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 863 mSDsluCounter, 2142 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1332 mSDsCounter, 321 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 669 IncrementalHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 321 mSolverCounterUnsat, 810 mSDtfsCounter, 669 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 683 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=859occurred in iteration=3, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 5 MinimizatonAttempts, 273 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 1287 ConstructedInterpolants, 0 QuantifiedInterpolants, 1937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 443 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 10503/10584 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 10:00:36,728 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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-ps-ci_file-35.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 10:00:38,894 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 10:00:38,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 10:00:38,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 10:00:38,971 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 10:00:39,002 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 10:00:39,003 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 10:00:39,004 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 10:00:39,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 10:00:39,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 10:00:39,006 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 10:00:39,007 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 10:00:39,007 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 10:00:39,008 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 10:00:39,008 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 10:00:39,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 10:00:39,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 10:00:39,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 10:00:39,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 10:00:39,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 10:00:39,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 10:00:39,014 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 10:00:39,014 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 10:00:39,014 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 10:00:39,015 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 10:00:39,015 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 10:00:39,015 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 10:00:39,015 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 10:00:39,015 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 10:00:39,015 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 10:00:39,016 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 10:00:39,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 10:00:39,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 10:00:39,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 10:00:39,016 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:00:39,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 10:00:39,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 10:00:39,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 10:00:39,019 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 10:00:39,019 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 10:00:39,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 10:00:39,020 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 10:00:39,020 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 10:00:39,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 10:00:39,020 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 10:00:39,020 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 -> 19520942352997fcf297d8ad079cb9fafb5c7d1c5c429124759a57b39998961b [2024-10-11 10:00:39,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 10:00:39,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 10:00:39,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 10:00:39,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 10:00:39,365 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 10:00:39,367 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-11 10:00:40,879 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 10:00:41,102 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 10:00:41,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-11 10:00:41,116 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a3eb21a81/1a20a7c5c6504ffeb297acd9808e70e6/FLAG8b0109ba7 [2024-10-11 10:00:41,130 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/a3eb21a81/1a20a7c5c6504ffeb297acd9808e70e6 [2024-10-11 10:00:41,132 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 10:00:41,133 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 10:00:41,135 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 10:00:41,136 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 10:00:41,141 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 10:00:41,141 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,142 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2810006d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41, skipping insertion in model container [2024-10-11 10:00:41,142 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,168 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 10:00:41,315 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-ps-ci_file-35.i[919,932] [2024-10-11 10:00:41,392 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:00:41,407 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 10:00:41,417 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-ps-ci_file-35.i[919,932] [2024-10-11 10:00:41,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 10:00:41,459 INFO L204 MainTranslator]: Completed translation [2024-10-11 10:00:41,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41 WrapperNode [2024-10-11 10:00:41,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 10:00:41,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 10:00:41,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 10:00:41,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 10:00:41,466 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,484 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,519 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 202 [2024-10-11 10:00:41,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 10:00:41,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 10:00:41,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 10:00:41,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 10:00:41,529 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,529 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,548 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 10:00:41,548 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,564 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,571 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,586 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 10:00:41,587 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 10:00:41,587 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 10:00:41,587 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 10:00:41,592 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (1/1) ... [2024-10-11 10:00:41,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 10:00:41,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 10:00:41,628 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 10:00:41,634 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 10:00:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 10:00:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 10:00:41,673 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 10:00:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 10:00:41,675 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 10:00:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 10:00:41,771 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 10:00:41,773 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 10:00:44,383 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-11 10:00:44,383 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 10:00:44,417 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 10:00:44,417 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 10:00:44,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:00:44 BoogieIcfgContainer [2024-10-11 10:00:44,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 10:00:44,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 10:00:44,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 10:00:44,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 10:00:44,422 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 10:00:41" (1/3) ... [2024-10-11 10:00:44,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29482c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:00:44, skipping insertion in model container [2024-10-11 10:00:44,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 10:00:41" (2/3) ... [2024-10-11 10:00:44,423 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29482c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 10:00:44, skipping insertion in model container [2024-10-11 10:00:44,423 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 10:00:44" (3/3) ... [2024-10-11 10:00:44,424 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-35.i [2024-10-11 10:00:44,437 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 10:00:44,438 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 10:00:44,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 10:00:44,497 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;@209c975b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 10:00:44,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 10:00:44,501 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:00:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 10:00:44,511 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:44,512 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:44,512 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:44,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:44,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1163003153, now seen corresponding path program 1 times [2024-10-11 10:00:44,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:00:44,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907126838] [2024-10-11 10:00:44,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:44,528 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 10:00:44,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:00:44,532 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 10:00:44,533 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 10:00:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:44,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 10:00:44,944 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:00:44,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 734 proven. 0 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2024-10-11 10:00:44,995 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:00:44,996 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:00:44,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907126838] [2024-10-11 10:00:44,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907126838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:44,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:44,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 10:00:44,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459328892] [2024-10-11 10:00:44,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:45,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 10:00:45,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:00:45,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 10:00:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 10:00:45,023 INFO L87 Difference]: Start difference. First operand has 81 states, 50 states have (on average 1.44) internal successors, (72), 51 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 10:00:46,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:00:46,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:46,100 INFO L93 Difference]: Finished difference Result 158 states and 280 transitions. [2024-10-11 10:00:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 10:00:46,119 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-10-11 10:00:46,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:46,125 INFO L225 Difference]: With dead ends: 158 [2024-10-11 10:00:46,125 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 10:00:46,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 179 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 10:00:46,130 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:46,130 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 10:00:46,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 10:00:46,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 10:00:46,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 48 states have internal predecessors, (64), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:00:46,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-11 10:00:46,163 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 180 [2024-10-11 10:00:46,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:46,164 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-11 10:00:46,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-11 10:00:46,164 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-11 10:00:46,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 10:00:46,167 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:46,167 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:46,182 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 10:00:46,368 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 10:00:46,369 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:46,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1719783159, now seen corresponding path program 1 times [2024-10-11 10:00:46,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:00:46,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814516274] [2024-10-11 10:00:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:46,373 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 10:00:46,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:00:46,376 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 10:00:46,377 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 10:00:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:46,726 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:00:46,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:00:46,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-10-11 10:00:46,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 10:00:47,250 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 27 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-10-11 10:00:47,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:00:47,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814516274] [2024-10-11 10:00:47,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814516274] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 10:00:47,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 10:00:47,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-10-11 10:00:47,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888059379] [2024-10-11 10:00:47,251 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 10:00:47,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 10:00:47,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:00:47,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 10:00:47,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-11 10:00:47,256 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-11 10:00:48,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:48,796 INFO L93 Difference]: Finished difference Result 161 states and 244 transitions. [2024-10-11 10:00:48,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 10:00:48,814 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 180 [2024-10-11 10:00:48,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:48,816 INFO L225 Difference]: With dead ends: 161 [2024-10-11 10:00:48,816 INFO L226 Difference]: Without dead ends: 84 [2024-10-11 10:00:48,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 352 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-11 10:00:48,820 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 69 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:48,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 186 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 10:00:48,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-11 10:00:48,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-10-11 10:00:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-11 10:00:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 122 transitions. [2024-10-11 10:00:48,834 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 122 transitions. Word has length 180 [2024-10-11 10:00:48,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:48,835 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 122 transitions. [2024-10-11 10:00:48,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2024-10-11 10:00:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 122 transitions. [2024-10-11 10:00:48,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 10:00:48,838 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:48,838 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:48,852 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 (3)] Forceful destruction successful, exit code 0 [2024-10-11 10:00:49,042 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 10:00:49,043 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:49,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:49,044 INFO L85 PathProgramCache]: Analyzing trace with hash 581039431, now seen corresponding path program 1 times [2024-10-11 10:00:49,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:00:49,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236997786] [2024-10-11 10:00:49,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:49,045 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 10:00:49,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:00:49,047 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 10:00:49,049 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 10:00:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:49,440 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 10:00:49,444 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:00:49,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:49,932 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:00:49,932 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:00:49,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236997786] [2024-10-11 10:00:49,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236997786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:49,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:49,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 10:00:49,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023994551] [2024-10-11 10:00:49,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:49,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 10:00:49,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:00:49,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 10:00:49,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 10:00:49,937 INFO L87 Difference]: Start difference. First operand 82 states and 122 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:51,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:00:52,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:00:52,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:52,396 INFO L93 Difference]: Finished difference Result 262 states and 390 transitions. [2024-10-11 10:00:52,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 10:00:52,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-11 10:00:52,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:52,416 INFO L225 Difference]: With dead ends: 262 [2024-10-11 10:00:52,416 INFO L226 Difference]: Without dead ends: 181 [2024-10-11 10:00:52,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:00:52,419 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 108 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:52,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 367 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-10-11 10:00:52,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-11 10:00:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 161. [2024-10-11 10:00:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 100 states have (on average 1.29) internal successors, (129), 100 states have internal predecessors, (129), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 10:00:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 241 transitions. [2024-10-11 10:00:52,461 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 241 transitions. Word has length 180 [2024-10-11 10:00:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 241 transitions. [2024-10-11 10:00:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 241 transitions. [2024-10-11 10:00:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-11 10:00:52,464 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:52,464 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:52,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-11 10:00:52,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:00:52,665 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:52,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:52,666 INFO L85 PathProgramCache]: Analyzing trace with hash -430077819, now seen corresponding path program 1 times [2024-10-11 10:00:52,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:00:52,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973099261] [2024-10-11 10:00:52,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:52,667 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 10:00:52,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:00:52,670 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:00:52,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-11 10:00:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:53,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 10:00:53,037 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:00:53,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:53,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:00:53,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:00:53,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [973099261] [2024-10-11 10:00:53,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [973099261] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:53,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:53,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 10:00:53,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655007935] [2024-10-11 10:00:53,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:53,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 10:00:53,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:00:53,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 10:00:53,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 10:00:53,370 INFO L87 Difference]: Start difference. First operand 161 states and 241 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:55,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 10:00:55,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:00:55,914 INFO L93 Difference]: Finished difference Result 503 states and 752 transitions. [2024-10-11 10:00:55,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 10:00:55,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-11 10:00:55,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:00:55,935 INFO L225 Difference]: With dead ends: 503 [2024-10-11 10:00:55,935 INFO L226 Difference]: Without dead ends: 343 [2024-10-11 10:00:55,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:00:55,936 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 90 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-10-11 10:00:55,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 413 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-10-11 10:00:55,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-10-11 10:00:55,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 319. [2024-10-11 10:00:55,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 198 states have (on average 1.2828282828282829) internal successors, (254), 198 states have internal predecessors, (254), 112 states have call successors, (112), 8 states have call predecessors, (112), 8 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-11 10:00:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 478 transitions. [2024-10-11 10:00:55,972 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 478 transitions. Word has length 180 [2024-10-11 10:00:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:00:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 478 transitions. [2024-10-11 10:00:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:00:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 478 transitions. [2024-10-11 10:00:55,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 10:00:55,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:00:55,975 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:00:55,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-10-11 10:00:56,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 10:00:56,176 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:00:56,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:00:56,177 INFO L85 PathProgramCache]: Analyzing trace with hash -113234026, now seen corresponding path program 1 times [2024-10-11 10:00:56,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:00:56,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197945966] [2024-10-11 10:00:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:00:56,178 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 10:00:56,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:00:56,180 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 10:00:56,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-11 10:00:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:00:56,518 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 10:00:56,521 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 10:00:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-11 10:00:56,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 10:00:56,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 10:00:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197945966] [2024-10-11 10:00:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197945966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 10:00:56,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 10:00:56,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 10:00:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123765946] [2024-10-11 10:00:56,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 10:00:56,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 10:00:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 10:00:56,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 10:00:56,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 10:00:56,601 INFO L87 Difference]: Start difference. First operand 319 states and 478 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:01:01,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 10:01:01,817 INFO L93 Difference]: Finished difference Result 1007 states and 1505 transitions. [2024-10-11 10:01:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 10:01:01,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-10-11 10:01:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 10:01:01,846 INFO L225 Difference]: With dead ends: 1007 [2024-10-11 10:01:01,852 INFO L226 Difference]: Without dead ends: 689 [2024-10-11 10:01:01,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 10:01:01,859 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 147 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 659 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-10-11 10:01:01,859 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 659 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-10-11 10:01:01,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2024-10-11 10:01:02,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 659. [2024-10-11 10:01:02,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 402 states have (on average 1.2587064676616915) internal successors, (506), 404 states have internal predecessors, (506), 238 states have call successors, (238), 18 states have call predecessors, (238), 18 states have return successors, (238), 236 states have call predecessors, (238), 238 states have call successors, (238) [2024-10-11 10:01:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 982 transitions. [2024-10-11 10:01:02,032 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 982 transitions. Word has length 181 [2024-10-11 10:01:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 10:01:02,033 INFO L471 AbstractCegarLoop]: Abstraction has 659 states and 982 transitions. [2024-10-11 10:01:02,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 6 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-11 10:01:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 982 transitions. [2024-10-11 10:01:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-11 10:01:02,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 10:01:02,035 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 10:01:02,071 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 (6)] Ended with exit code 0 [2024-10-11 10:01:02,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 10:01:02,239 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 10:01:02,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 10:01:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash -55975724, now seen corresponding path program 1 times [2024-10-11 10:01:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 10:01:02,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [971284658] [2024-10-11 10:01:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 10:01:02,242 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 10:01:02,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 10:01:02,243 INFO L229 MonitoredProcess]: Starting monitored process 7 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 10:01:02,245 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 (7)] Waiting until timeout for monitored process [2024-10-11 10:01:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 10:01:02,773 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-10-11 10:01:02,780 INFO L278 TraceCheckSpWp]: Computing forward predicates...