./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_loopvsstraightlinecode_100-1loop_file-72.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_loopvsstraightlinecode_100-1loop_file-72.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 ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:09:38,779 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:09:38,817 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:09:38,820 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:09:38,821 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:09:38,836 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:09:38,836 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:09:38,837 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:09:38,837 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:09:38,838 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:09:38,838 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:09:38,838 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:09:38,839 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:09:38,839 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:09:38,839 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:09:38,840 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:09:38,840 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:09:38,840 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:09:38,841 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:09:38,841 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:09:38,841 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:09:38,842 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:09:38,842 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:09:38,842 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:09:38,843 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:09:38,843 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:09:38,843 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:09:38,843 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:09:38,844 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:09:38,844 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:09:38,844 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:09:38,845 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:09:38,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:09:38,845 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:09:38,846 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:09:38,846 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:09:38,846 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:09:38,847 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:09:38,847 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:09:38,848 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:09:38,848 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:09:38,848 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:09:38,849 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 -> ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 [2024-10-11 11:09:39,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:09:39,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:09:39,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:09:39,083 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:09:39,084 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:09:39,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-10-11 11:09:40,412 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:09:40,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:09:40,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-10-11 11:09:40,601 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11be53b87/4fc9cd855b274735aa029f442eaedf97/FLAG6945c91ef [2024-10-11 11:09:40,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/11be53b87/4fc9cd855b274735aa029f442eaedf97 [2024-10-11 11:09:40,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:09:40,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:09:40,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:09:40,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:09:40,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:09:40,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:09:40" (1/1) ... [2024-10-11 11:09:40,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ade5a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:40, skipping insertion in model container [2024-10-11 11:09:40,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:09:40" (1/1) ... [2024-10-11 11:09:41,014 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:09:41,184 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_loopvsstraightlinecode_100-1loop_file-72.i[916,929] [2024-10-11 11:09:41,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:09:41,291 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:09:41,302 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_loopvsstraightlinecode_100-1loop_file-72.i[916,929] [2024-10-11 11:09:41,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:09:41,357 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:09:41,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41 WrapperNode [2024-10-11 11:09:41,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:09:41,360 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:09:41,362 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:09:41,363 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:09:41,368 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,379 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,437 INFO L138 Inliner]: procedures = 26, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 309 [2024-10-11 11:09:41,438 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:09:41,438 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:09:41,438 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:09:41,438 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:09:41,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,448 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,454 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,480 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 11:09:41,480 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,480 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,494 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,500 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,502 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,514 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:09:41,514 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:09:41,515 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:09:41,515 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:09:41,515 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (1/1) ... [2024-10-11 11:09:41,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:09:41,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:09:41,548 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 11:09:41,550 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 11:09:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:09:41,585 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:09:41,586 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:09:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:09:41,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:09:41,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:09:41,682 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:09:41,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:09:42,174 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2024-10-11 11:09:42,175 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:09:42,198 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:09:42,199 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:09:42,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:09:42 BoogieIcfgContainer [2024-10-11 11:09:42,199 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:09:42,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:09:42,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:09:42,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:09:42,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:09:40" (1/3) ... [2024-10-11 11:09:42,204 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc7a211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:09:42, skipping insertion in model container [2024-10-11 11:09:42,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:09:41" (2/3) ... [2024-10-11 11:09:42,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fc7a211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:09:42, skipping insertion in model container [2024-10-11 11:09:42,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:09:42" (3/3) ... [2024-10-11 11:09:42,208 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-10-11 11:09:42,223 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:09:42,223 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:09:42,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:09:42,291 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;@3380681a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:09:42,291 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:09:42,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 88 states have internal predecessors, (131), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 11:09:42,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 11:09:42,308 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:42,309 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:42,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:42,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -238001256, now seen corresponding path program 1 times [2024-10-11 11:09:42,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:42,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052596068] [2024-10-11 11:09:42,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:42,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:42,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:42,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:42,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:42,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:42,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:42,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:42,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:42,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:42,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:42,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:42,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:42,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:42,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 11:09:42,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:42,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052596068] [2024-10-11 11:09:42,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052596068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:42,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:42,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:09:42,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769025142] [2024-10-11 11:09:42,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:42,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:09:42,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:09:42,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:09:42,805 INFO L87 Difference]: Start difference. First operand has 119 states, 87 states have (on average 1.5057471264367817) internal successors, (131), 88 states have internal predecessors, (131), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 11:09:42,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:42,848 INFO L93 Difference]: Finished difference Result 233 states and 400 transitions. [2024-10-11 11:09:42,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:09:42,851 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) Word has length 190 [2024-10-11 11:09:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:42,860 INFO L225 Difference]: With dead ends: 233 [2024-10-11 11:09:42,860 INFO L226 Difference]: Without dead ends: 113 [2024-10-11 11:09:42,892 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:09:42,895 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:42,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:09:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-11 11:09:42,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-11 11:09:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 82 states have internal predecessors, (118), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 11:09:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 176 transitions. [2024-10-11 11:09:42,995 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 176 transitions. Word has length 190 [2024-10-11 11:09:42,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:42,995 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 176 transitions. [2024-10-11 11:09:42,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 11:09:42,995 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 176 transitions. [2024-10-11 11:09:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 11:09:43,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:43,002 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:43,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:09:43,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:43,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash 21631318, now seen corresponding path program 1 times [2024-10-11 11:09:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:43,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357015954] [2024-10-11 11:09:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:43,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:43,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:43,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:43,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:43,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:43,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:43,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:43,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:43,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:43,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:43,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:43,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:43,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:43,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:43,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:43,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 11:09:43,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:43,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357015954] [2024-10-11 11:09:43,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357015954] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:43,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:43,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 11:09:43,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793278483] [2024-10-11 11:09:43,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:43,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 11:09:43,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 11:09:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 11:09:43,817 INFO L87 Difference]: Start difference. First operand 113 states and 176 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:44,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:44,218 INFO L93 Difference]: Finished difference Result 410 states and 631 transitions. [2024-10-11 11:09:44,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:09:44,218 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-11 11:09:44,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:44,227 INFO L225 Difference]: With dead ends: 410 [2024-10-11 11:09:44,227 INFO L226 Difference]: Without dead ends: 298 [2024-10-11 11:09:44,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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 11:09:44,232 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 303 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:44,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 808 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:09:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-10-11 11:09:44,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 279. [2024-10-11 11:09:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 210 states have (on average 1.4142857142857144) internal successors, (297), 211 states have internal predecessors, (297), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 11:09:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 425 transitions. [2024-10-11 11:09:44,278 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 425 transitions. Word has length 190 [2024-10-11 11:09:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:44,279 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 425 transitions. [2024-10-11 11:09:44,279 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, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 425 transitions. [2024-10-11 11:09:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 11:09:44,284 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:44,284 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:44,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 11:09:44,284 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:44,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:44,287 INFO L85 PathProgramCache]: Analyzing trace with hash 722695896, now seen corresponding path program 1 times [2024-10-11 11:09:44,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:44,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600505553] [2024-10-11 11:09:44,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:44,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:45,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:45,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:45,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:45,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:45,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:45,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:45,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:45,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:45,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:45,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:45,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:45,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:45,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:45,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 11:09:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600505553] [2024-10-11 11:09:45,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600505553] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:45,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:45,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:09:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697980549] [2024-10-11 11:09:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:45,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:09:45,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:09:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:09:45,345 INFO L87 Difference]: Start difference. First operand 279 states and 425 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:45,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:45,673 INFO L93 Difference]: Finished difference Result 814 states and 1219 transitions. [2024-10-11 11:09:45,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 11:09:45,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-11 11:09:45,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:45,678 INFO L225 Difference]: With dead ends: 814 [2024-10-11 11:09:45,678 INFO L226 Difference]: Without dead ends: 536 [2024-10-11 11:09:45,679 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:09:45,680 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 272 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:45,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 692 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:09:45,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2024-10-11 11:09:45,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 462. [2024-10-11 11:09:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 384 states have (on average 1.4427083333333333) internal successors, (554), 388 states have internal predecessors, (554), 70 states have call successors, (70), 7 states have call predecessors, (70), 7 states have return successors, (70), 66 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-11 11:09:45,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 694 transitions. [2024-10-11 11:09:45,710 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 694 transitions. Word has length 190 [2024-10-11 11:09:45,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:45,710 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 694 transitions. [2024-10-11 11:09:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 694 transitions. [2024-10-11 11:09:45,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-10-11 11:09:45,712 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:45,713 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:45,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 11:09:45,713 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:45,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:45,713 INFO L85 PathProgramCache]: Analyzing trace with hash 863244506, now seen corresponding path program 1 times [2024-10-11 11:09:45,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229340622] [2024-10-11 11:09:45,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:46,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:46,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:46,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:46,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:46,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:46,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:46,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:46,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 11:09:46,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:46,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229340622] [2024-10-11 11:09:46,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229340622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:46,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:46,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 11:09:46,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21475046] [2024-10-11 11:09:46,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:46,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:09:46,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:46,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:09:46,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:09:46,827 INFO L87 Difference]: Start difference. First operand 462 states and 694 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:47,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:47,199 INFO L93 Difference]: Finished difference Result 976 states and 1444 transitions. [2024-10-11 11:09:47,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 11:09:47,199 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 190 [2024-10-11 11:09:47,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:47,204 INFO L225 Difference]: With dead ends: 976 [2024-10-11 11:09:47,205 INFO L226 Difference]: Without dead ends: 515 [2024-10-11 11:09:47,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-10-11 11:09:47,208 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 213 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 858 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:47,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 858 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:09:47,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2024-10-11 11:09:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 398. [2024-10-11 11:09:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 314 states have (on average 1.414012738853503) internal successors, (444), 318 states have internal predecessors, (444), 74 states have call successors, (74), 9 states have call predecessors, (74), 9 states have return successors, (74), 70 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-11 11:09:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 592 transitions. [2024-10-11 11:09:47,246 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 592 transitions. Word has length 190 [2024-10-11 11:09:47,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:47,249 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 592 transitions. [2024-10-11 11:09:47,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:47,249 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 592 transitions. [2024-10-11 11:09:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 11:09:47,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:47,251 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:47,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 11:09:47,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:47,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash -74707602, now seen corresponding path program 1 times [2024-10-11 11:09:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:47,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68225984] [2024-10-11 11:09:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:47,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:47,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:47,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:47,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,609 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:47,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:47,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:47,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:47,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:47,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:47,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 11:09:47,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:47,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68225984] [2024-10-11 11:09:47,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68225984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:47,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 11:09:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397507308] [2024-10-11 11:09:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:47,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 11:09:47,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:47,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 11:09:47,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 11:09:47,636 INFO L87 Difference]: Start difference. First operand 398 states and 592 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:47,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:47,889 INFO L93 Difference]: Finished difference Result 1054 states and 1561 transitions. [2024-10-11 11:09:47,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:09:47,889 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-10-11 11:09:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:47,893 INFO L225 Difference]: With dead ends: 1054 [2024-10-11 11:09:47,893 INFO L226 Difference]: Without dead ends: 657 [2024-10-11 11:09:47,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 61 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 11:09:47,895 INFO L432 NwaCegarLoop]: 178 mSDtfsCounter, 108 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:47,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 450 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 11:09:47,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2024-10-11 11:09:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2024-10-11 11:09:47,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 526 states have (on average 1.4068441064638784) internal successors, (740), 535 states have internal predecessors, (740), 110 states have call successors, (110), 16 states have call predecessors, (110), 16 states have return successors, (110), 101 states have call predecessors, (110), 110 states have call successors, (110) [2024-10-11 11:09:47,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 960 transitions. [2024-10-11 11:09:47,955 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 960 transitions. Word has length 192 [2024-10-11 11:09:47,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:47,955 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 960 transitions. [2024-10-11 11:09:47,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:47,955 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 960 transitions. [2024-10-11 11:09:47,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 11:09:47,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:47,957 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:47,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 11:09:47,958 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:47,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:47,958 INFO L85 PathProgramCache]: Analyzing trace with hash 975486909, now seen corresponding path program 1 times [2024-10-11 11:09:47,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:47,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524304741] [2024-10-11 11:09:47,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:47,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:48,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:48,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:48,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:48,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:48,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:48,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 11:09:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524304741] [2024-10-11 11:09:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524304741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:09:48,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500090379] [2024-10-11 11:09:48,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:48,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:09:48,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:09:48,225 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 11:09:48,229 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 11:09:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:48,369 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:09:48,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:09:48,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-10-11 11:09:48,634 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:09:48,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 11:09:48,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500090379] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:09:48,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 11:09:48,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 11:09:48,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162192686] [2024-10-11 11:09:48,851 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 11:09:48,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:09:48,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:48,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:09:48,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:09:48,852 INFO L87 Difference]: Start difference. First operand 653 states and 960 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-11 11:09:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:49,090 INFO L93 Difference]: Finished difference Result 1198 states and 1721 transitions. [2024-10-11 11:09:49,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:09:49,091 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 192 [2024-10-11 11:09:49,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:49,094 INFO L225 Difference]: With dead ends: 1198 [2024-10-11 11:09:49,094 INFO L226 Difference]: Without dead ends: 546 [2024-10-11 11:09:49,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 448 GetRequests, 437 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:09:49,096 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 99 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:49,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 344 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 11:09:49,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2024-10-11 11:09:49,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 506. [2024-10-11 11:09:49,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 506 states, 381 states have (on average 1.3333333333333333) internal successors, (508), 387 states have internal predecessors, (508), 104 states have call successors, (104), 20 states have call predecessors, (104), 20 states have return successors, (104), 98 states have call predecessors, (104), 104 states have call successors, (104) [2024-10-11 11:09:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 716 transitions. [2024-10-11 11:09:49,158 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 716 transitions. Word has length 192 [2024-10-11 11:09:49,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:49,158 INFO L471 AbstractCegarLoop]: Abstraction has 506 states and 716 transitions. [2024-10-11 11:09:49,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-11 11:09:49,159 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 716 transitions. [2024-10-11 11:09:49,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 11:09:49,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:49,161 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:49,177 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 11:09:49,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:09:49,365 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:49,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:49,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1396252353, now seen corresponding path program 1 times [2024-10-11 11:09:49,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:49,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490950428] [2024-10-11 11:09:49,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:49,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:49,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:09:49,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793801687] [2024-10-11 11:09:49,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:49,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:09:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:09:49,472 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 11:09:49,474 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 11:09:49,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:49,599 INFO L255 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-11 11:09:49,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:09:50,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 852 proven. 216 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2024-10-11 11:09:50,481 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:09:52,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:52,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490950428] [2024-10-11 11:09:52,745 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 11:09:52,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793801687] [2024-10-11 11:09:52,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793801687] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:09:52,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-11 11:09:52,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-10-11 11:09:52,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118918460] [2024-10-11 11:09:52,746 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-11 11:09:52,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 11:09:52,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:52,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 11:09:52,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=398, Unknown=0, NotChecked=0, Total=506 [2024-10-11 11:09:52,748 INFO L87 Difference]: Start difference. First operand 506 states and 716 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-11 11:09:55,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:55,776 INFO L93 Difference]: Finished difference Result 1353 states and 1857 transitions. [2024-10-11 11:09:55,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2024-10-11 11:09:55,776 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) Word has length 192 [2024-10-11 11:09:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:55,781 INFO L225 Difference]: With dead ends: 1353 [2024-10-11 11:09:55,781 INFO L226 Difference]: Without dead ends: 855 [2024-10-11 11:09:55,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 278 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=736, Invalid=2344, Unknown=0, NotChecked=0, Total=3080 [2024-10-11 11:09:55,783 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 479 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:55,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 1219 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 11:09:55,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-11 11:09:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 652. [2024-10-11 11:09:55,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 477 states have (on average 1.2851153039832286) internal successors, (613), 483 states have internal predecessors, (613), 136 states have call successors, (136), 38 states have call predecessors, (136), 38 states have return successors, (136), 130 states have call predecessors, (136), 136 states have call successors, (136) [2024-10-11 11:09:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2024-10-11 11:09:55,856 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 192 [2024-10-11 11:09:55,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:55,857 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2024-10-11 11:09:55,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 14 states have internal predecessors, (65), 5 states have call successors, (29), 5 states have call predecessors, (29), 6 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2024-10-11 11:09:55,857 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2024-10-11 11:09:55,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 11:09:55,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:55,867 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:55,890 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 11:09:56,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:09:56,068 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:56,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:56,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1339047342, now seen corresponding path program 1 times [2024-10-11 11:09:56,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:56,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309876675] [2024-10-11 11:09:56,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:56,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:09:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:09:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:09:57,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:09:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:09:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:09:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:09:57,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:09:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:09:57,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:09:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:09:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:09:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:09:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 11:09:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:09:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:09:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 11:09:57,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:09:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:09:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 11:09:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 11:09:57,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 11:09:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 11:09:57,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-10-11 11:09:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-10-11 11:09:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 11:09:57,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-10-11 11:09:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-10-11 11:09:57,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-10-11 11:09:57,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:09:57,093 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1624 trivial. 0 not checked. [2024-10-11 11:09:57,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:09:57,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309876675] [2024-10-11 11:09:57,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309876675] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:09:57,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:09:57,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 11:09:57,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117837491] [2024-10-11 11:09:57,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:09:57,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 11:09:57,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:09:57,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 11:09:57,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 11:09:57,095 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:57,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:09:57,487 INFO L93 Difference]: Finished difference Result 1263 states and 1708 transitions. [2024-10-11 11:09:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 11:09:57,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) Word has length 192 [2024-10-11 11:09:57,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:09:57,492 INFO L225 Difference]: With dead ends: 1263 [2024-10-11 11:09:57,492 INFO L226 Difference]: Without dead ends: 619 [2024-10-11 11:09:57,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:09:57,496 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 107 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 11:09:57,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 679 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 11:09:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-11 11:09:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 522. [2024-10-11 11:09:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 379 states have (on average 1.279683377308707) internal successors, (485), 383 states have internal predecessors, (485), 112 states have call successors, (112), 30 states have call predecessors, (112), 30 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2024-10-11 11:09:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 709 transitions. [2024-10-11 11:09:57,568 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 709 transitions. Word has length 192 [2024-10-11 11:09:57,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:09:57,572 INFO L471 AbstractCegarLoop]: Abstraction has 522 states and 709 transitions. [2024-10-11 11:09:57,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 1 states have call predecessors, (29), 1 states have call successors, (29) [2024-10-11 11:09:57,572 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 709 transitions. [2024-10-11 11:09:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-10-11 11:09:57,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:09:57,575 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:57,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 11:09:57,575 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:09:57,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:09:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1905725443, now seen corresponding path program 1 times [2024-10-11 11:09:57,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:09:57,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082288183] [2024-10-11 11:09:57,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:57,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:09:57,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:09:57,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1224969940] [2024-10-11 11:09:57,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:09:57,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:09:57,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:09:57,665 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:09:57,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 11:09:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:09:57,781 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:09:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:09:57,984 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:09:57,985 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:09:57,986 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:09:58,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 11:09:58,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:09:58,191 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:09:58,322 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:09:58,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:09:58 BoogieIcfgContainer [2024-10-11 11:09:58,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:09:58,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:09:58,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:09:58,325 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:09:58,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:09:42" (3/4) ... [2024-10-11 11:09:58,328 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:09:58,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:09:58,329 INFO L158 Benchmark]: Toolchain (without parser) took 17350.46ms. Allocated memory was 146.8MB in the beginning and 497.0MB in the end (delta: 350.2MB). Free memory was 74.9MB in the beginning and 420.8MB in the end (delta: -346.0MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,330 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:09:58,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 379.07ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 74.5MB in the beginning and 182.0MB in the end (delta: -107.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.03ms. Allocated memory is still 216.0MB. Free memory was 182.0MB in the beginning and 175.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,330 INFO L158 Benchmark]: Boogie Preprocessor took 75.55ms. Allocated memory is still 216.0MB. Free memory was 175.7MB in the beginning and 166.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,331 INFO L158 Benchmark]: RCFGBuilder took 684.99ms. Allocated memory is still 216.0MB. Free memory was 166.3MB in the beginning and 123.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,331 INFO L158 Benchmark]: TraceAbstraction took 16124.02ms. Allocated memory was 216.0MB in the beginning and 497.0MB in the end (delta: 281.0MB). Free memory was 123.3MB in the beginning and 421.9MB in the end (delta: -298.6MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,331 INFO L158 Benchmark]: Witness Printer took 3.80ms. Allocated memory is still 497.0MB. Free memory was 421.9MB in the beginning and 420.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 11:09:58,332 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 98.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 379.07ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 74.5MB in the beginning and 182.0MB in the end (delta: -107.5MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.03ms. Allocated memory is still 216.0MB. Free memory was 182.0MB in the beginning and 175.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 75.55ms. Allocated memory is still 216.0MB. Free memory was 175.7MB in the beginning and 166.3MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 684.99ms. Allocated memory is still 216.0MB. Free memory was 166.3MB in the beginning and 123.3MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 16124.02ms. Allocated memory was 216.0MB in the beginning and 497.0MB in the end (delta: 281.0MB). Free memory was 123.3MB in the beginning and 421.9MB in the end (delta: -298.6MB). Peak memory consumption was 237.2MB. Max. memory is 16.1GB. * Witness Printer took 3.80ms. Allocated memory is still 497.0MB. Free memory was 421.9MB in the beginning and 420.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 200, overapproximation of someBinaryFLOATComparisonOperation at line 200. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed short int var_1_8 = -16; [L28] signed long int var_1_12 = -10; [L29] double var_1_14 = 127.8; [L30] double var_1_15 = 1.375; [L31] unsigned char var_1_19 = 1; [L32] float var_1_20 = 10.4; [L33] float var_1_21 = 3.075; [L34] double var_1_22 = 64.375; [L35] signed char var_1_23 = 16; [L36] signed char var_1_24 = 64; [L37] signed char var_1_25 = 0; [L38] double var_1_26 = 255.125; [L39] unsigned short int var_1_27 = 128; [L40] unsigned char var_1_28 = 1; [L41] unsigned short int var_1_29 = 128; [L42] unsigned short int var_1_30 = 49567; [L43] unsigned short int var_1_31 = 100; [L44] unsigned short int var_1_32 = 0; [L45] unsigned short int var_1_33 = 1; [L46] unsigned short int var_1_34 = 4; [L47] unsigned short int var_1_35 = 0; [L48] unsigned long int var_1_36 = 16; [L49] signed short int last_1_var_1_8 = -16; [L50] signed long int last_1_var_1_12 = -10; [L51] float last_1_var_1_20 = 10.4; [L52] signed char last_1_var_1_23 = 16; [L53] unsigned char last_1_var_1_28 = 1; [L54] unsigned short int last_1_var_1_29 = 128; [L55] unsigned long int last_1_var_1_36 = 16; [L204] isInitial = 1 [L205] FCALL initially() [L206] int k_loop; [L207] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L207] COND TRUE k_loop < 1 [L208] CALL updateLastVariables() [L191] last_1_var_1_8 = var_1_8 [L192] last_1_var_1_12 = var_1_12 [L193] last_1_var_1_20 = var_1_20 [L194] last_1_var_1_23 = var_1_23 [L195] last_1_var_1_28 = var_1_28 [L196] last_1_var_1_29 = var_1_29 [L197] last_1_var_1_36 = var_1_36 [L208] RET updateLastVariables() [L209] CALL updateVariables() [L145] var_1_4 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L146] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L147] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L148] var_1_5 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L149] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L150] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L151] var_1_6 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L152] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=-16] [L153] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L153] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L154] var_1_7 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L155] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_8=-16] [L156] CALL assume_abort_if_not(var_1_7 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L156] RET assume_abort_if_not(var_1_7 <= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_14=639/5, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L157] var_1_14 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L158] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] CALL assume_abort_if_not(var_1_14 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L159] RET assume_abort_if_not(var_1_14 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_15=11/8, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L160] var_1_15 = __VERIFIER_nondet_double() [L161] CALL assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L161] RET assume_abort_if_not((var_1_15 >= -922337.2036854776000e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854776000e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] CALL assume_abort_if_not(var_1_15 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L162] RET assume_abort_if_not(var_1_15 != 0.0F) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=123/40, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L163] var_1_21 = __VERIFIER_nondet_float() [L164] CALL assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L164] RET assume_abort_if_not((var_1_21 >= -461168.6018427382800e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=64, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L165] var_1_24 = __VERIFIER_nondet_char() [L166] CALL assume_abort_if_not(var_1_24 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L166] RET assume_abort_if_not(var_1_24 >= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L167] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=0, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L168] var_1_25 = __VERIFIER_nondet_char() [L169] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L169] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] CALL assume_abort_if_not(var_1_25 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L170] RET assume_abort_if_not(var_1_25 <= 63) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=49567, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L171] var_1_30 = __VERIFIER_nondet_ushort() [L172] CALL assume_abort_if_not(var_1_30 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L172] RET assume_abort_if_not(var_1_30 >= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] CALL assume_abort_if_not(var_1_30 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L173] RET assume_abort_if_not(var_1_30 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=100, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L174] var_1_31 = __VERIFIER_nondet_ushort() [L175] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L175] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L176] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L177] var_1_32 = __VERIFIER_nondet_ushort() [L178] CALL assume_abort_if_not(var_1_32 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L178] RET assume_abort_if_not(var_1_32 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] CALL assume_abort_if_not(var_1_32 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L179] RET assume_abort_if_not(var_1_32 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L180] var_1_33 = __VERIFIER_nondet_ushort() [L181] CALL assume_abort_if_not(var_1_33 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L181] RET assume_abort_if_not(var_1_33 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L182] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=4, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L183] var_1_34 = __VERIFIER_nondet_ushort() [L184] CALL assume_abort_if_not(var_1_34 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L184] RET assume_abort_if_not(var_1_34 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] CALL assume_abort_if_not(var_1_34 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L185] RET assume_abort_if_not(var_1_34 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L186] var_1_35 = __VERIFIER_nondet_ushort() [L187] CALL assume_abort_if_not(var_1_35 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L187] RET assume_abort_if_not(var_1_35 >= 0) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] CALL assume_abort_if_not(var_1_35 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L188] RET assume_abort_if_not(var_1_35 <= 32767) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L209] RET updateVariables() [L210] CALL step() [L59] signed long int stepLocal_7 = last_1_var_1_23 + var_1_24; [L60] signed long int stepLocal_6 = last_1_var_1_23; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=1, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L61] COND FALSE !(\read(var_1_7)) [L70] var_1_28 = 0 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L72] unsigned char stepLocal_5 = var_1_21 != last_1_var_1_20; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_5=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=16, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L73] COND FALSE !((var_1_6 || last_1_var_1_28) && stepLocal_5) [L76] var_1_23 = (var_1_25 - var_1_24) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2041/8, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L78] COND FALSE !(\read(var_1_5)) [L81] var_1_26 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=128, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L83] var_1_27 = var_1_24 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=-16] [L84] COND FALSE !(\read(var_1_28)) [L87] var_1_8 = var_1_23 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L89] unsigned char stepLocal_3 = var_1_27 < (var_1_23 >> 25); [L90] unsigned short int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_3=0, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=1, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L91] COND FALSE !(stepLocal_3 && var_1_6) [L98] var_1_19 = var_1_7 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L100] signed long int stepLocal_4 = last_1_var_1_8; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_4=-16, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=52/5, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L101] COND FALSE !(last_1_var_1_23 <= stepLocal_4) [L104] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=515/8, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L106] COND TRUE var_1_20 > var_1_15 [L107] var_1_22 = var_1_21 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=128, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L109] COND TRUE var_1_20 < var_1_14 [L110] var_1_29 = ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] EXPR (var_1_23 * var_1_23) & var_1_8 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L114] signed long int stepLocal_1 = (var_1_23 * var_1_23) & var_1_8; [L115] COND TRUE (var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=-10, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L116] COND TRUE var_1_14 >= (var_1_15 * var_1_22) [L117] var_1_12 = (var_1_23 + var_1_23) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L128] unsigned char stepLocal_0 = var_1_28; VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_0=0, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L129] COND FALSE !(stepLocal_0 || var_1_19) [L132] var_1_1 = (var_1_4 && ((var_1_5 || var_1_6) || var_1_7)) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=16, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L134] COND TRUE (var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36) [L135] var_1_36 = var_1_30 VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, stepLocal_1=0, stepLocal_2=63, stepLocal_6=16, stepLocal_7=79, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L210] RET step() [L211] CALL, EXPR property() [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR (((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23)))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200] EXPR ((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0))) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L200-L201] return ((((((((((((var_1_28 || var_1_19) ? (var_1_1 == ((unsigned char) (var_1_19 && var_1_4))) : (var_1_1 == ((unsigned char) (var_1_4 && ((var_1_5 || var_1_6) || var_1_7))))) && (var_1_28 ? (var_1_8 == ((signed short int) (((((-10000 + var_1_23)) < (((var_1_23 + 64) + var_1_23))) ? ((-10000 + var_1_23)) : (((var_1_23 + 64) + var_1_23)))))) : (var_1_8 == ((signed short int) var_1_23)))) && (((var_1_22 / ((((var_1_14) < (var_1_15)) ? (var_1_14) : (var_1_15)))) >= (var_1_20 * var_1_26)) ? ((var_1_14 >= (var_1_15 * var_1_22)) ? (var_1_12 == ((signed long int) (var_1_23 + var_1_23))) : (var_1_12 == ((signed long int) (last_1_var_1_12 + var_1_23)))) : (((var_1_23 >> last_1_var_1_12) > ((var_1_23 * var_1_23) & var_1_8)) ? (var_1_12 == ((signed long int) var_1_23)) : (var_1_12 == ((signed long int) var_1_23))))) && (((var_1_27 < (var_1_23 >> 25)) && var_1_6) ? ((var_1_27 < (var_1_23 | var_1_23)) ? (var_1_19 == ((unsigned char) var_1_5)) : (var_1_19 == ((unsigned char) var_1_4))) : (var_1_19 == ((unsigned char) var_1_7)))) && ((last_1_var_1_23 <= last_1_var_1_8) ? (var_1_20 == ((float) (var_1_21 + 10.4f))) : (var_1_20 == ((float) var_1_21)))) && ((var_1_20 > var_1_15) ? (var_1_22 == ((double) var_1_21)) : 1)) && (((var_1_6 || last_1_var_1_28) && (var_1_21 != last_1_var_1_20)) ? (var_1_23 == ((signed char) (-1 - (var_1_24 - var_1_25)))) : (var_1_23 == ((signed char) (var_1_25 - var_1_24))))) && (var_1_5 ? (var_1_26 == ((double) ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21))))) : (var_1_26 == ((double) var_1_21)))) && (var_1_27 == ((unsigned short int) var_1_24))) && (var_1_7 ? (((last_1_var_1_23 + var_1_24) < (last_1_var_1_36 ^ last_1_var_1_29)) ? ((last_1_var_1_36 <= last_1_var_1_23) ? (var_1_28 == ((unsigned char) var_1_4)) : (var_1_28 == ((unsigned char) var_1_6))) : 1) : (var_1_28 == ((unsigned char) 0)))) && ((var_1_20 < var_1_14) ? (var_1_29 == ((unsigned short int) ((((((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) < (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33))))) ? (((((var_1_24) > ((var_1_30 - var_1_25))) ? (var_1_24) : ((var_1_30 - var_1_25))))) : (((((((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) > (var_1_33)) ? (((((var_1_31) < (var_1_32)) ? (var_1_31) : (var_1_32)))) : (var_1_33)))))))) : (var_1_29 == ((unsigned short int) ((((var_1_24) > ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35))) ? (var_1_24) : ((((((var_1_25) > (var_1_34)) ? (var_1_25) : (var_1_34))) + var_1_35)))))))) && (((var_1_12 < (var_1_33 + var_1_30)) || (256 > last_1_var_1_36)) ? (var_1_36 == ((unsigned long int) var_1_30)) : ((((var_1_28 || var_1_19) || var_1_7) && var_1_1) ? (var_1_36 == ((unsigned long int) var_1_31)) : (var_1_36 == ((unsigned long int) var_1_34)))) ; [L211] RET, EXPR property() [L211] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=-10, last_1_var_1_20=52/5, last_1_var_1_23=16, last_1_var_1_28=1, last_1_var_1_29=128, last_1_var_1_36=16, last_1_var_1_8=-16, var_1_12=0, var_1_19=0, var_1_1=0, var_1_20=2, var_1_21=2, var_1_22=2, var_1_23=0, var_1_24=63, var_1_25=63, var_1_26=2, var_1_27=63, var_1_28=0, var_1_29=0, var_1_30=32767, var_1_31=0, var_1_32=1, var_1_33=0, var_1_34=0, var_1_35=0, var_1_36=32767, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 119 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 9, TraceHistogramMax: 29, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1598 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1581 mSDsluCounter, 5223 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3652 mSDsCounter, 220 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2503 IncrementalHoareTripleChecker+Invalid, 2723 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 220 mSolverCounterUnsat, 1571 mSDtfsCounter, 2503 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1200 GetRequests, 1111 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=653occurred in iteration=5, InterpolantAutomatonStates: 87, 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, 8 MinimizatonAttempts, 554 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.1s InterpolantComputationTime, 2296 NumberOfCodeBlocks, 2296 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1902 ConstructedInterpolants, 10 QuantifiedInterpolants, 6618 SizeOfPredicates, 7 NumberOfNonLiveVariables, 927 ConjunctsInSsa, 37 ConjunctsInUnsatCore, 10 InterpolantComputations, 6 PerfectInterpolantSequences, 15799/16240 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:09:58,401 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_loopvsstraightlinecode_100-1loop_file-72.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 ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:10:01,721 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:10:01,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:10:01,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:10:01,800 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:10:01,846 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:10:01,847 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:10:01,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:10:01,848 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:10:01,849 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:10:01,850 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:10:01,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:10:01,851 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:10:01,851 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:10:01,854 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:10:01,854 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:10:01,855 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:10:01,855 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:10:01,855 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:10:01,855 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:10:01,855 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:10:01,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:10:01,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:10:01,857 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:10:01,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:10:01,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:10:01,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:10:01,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:10:01,857 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:01,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:10:01,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:10:01,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:10:01,858 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:10:01,858 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:10:01,858 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:10:01,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:10:01,860 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:10:01,860 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:10:01,861 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:10:01,861 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 -> ef8d599aaab4423f4d5111d720b46d2b710d7fd58e3e665c60b9f1b1b95811e3 [2024-10-11 11:10:02,162 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:10:02,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:10:02,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:10:02,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:10:02,197 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:10:02,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-10-11 11:10:04,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:10:04,292 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:10:04,293 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-10-11 11:10:04,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd5736385/5cf752ccffb54cd8a599c3a896a48228/FLAG553494575 [2024-10-11 11:10:04,665 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bd5736385/5cf752ccffb54cd8a599c3a896a48228 [2024-10-11 11:10:04,667 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:10:04,669 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:10:04,669 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:04,670 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:10:04,674 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:10:04,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:04" (1/1) ... [2024-10-11 11:10:04,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fad52b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:04, skipping insertion in model container [2024-10-11 11:10:04,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:10:04" (1/1) ... [2024-10-11 11:10:04,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:10:04,851 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_loopvsstraightlinecode_100-1loop_file-72.i[916,929] [2024-10-11 11:10:04,963 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:04,980 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:10:04,992 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-72.i[916,929] [2024-10-11 11:10:05,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:10:05,055 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:10:05,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05 WrapperNode [2024-10-11 11:10:05,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:10:05,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:05,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:10:05,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:10:05,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,084 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,128 INFO L138 Inliner]: procedures = 27, calls = 42, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2024-10-11 11:10:05,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:10:05,133 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:10:05,133 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:10:05,133 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:10:05,145 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,145 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,175 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 11:10:05,176 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,176 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,188 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,199 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:10:05,216 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:10:05,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:10:05,219 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:10:05,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (1/1) ... [2024-10-11 11:10:05,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:10:05,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:10:05,254 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 11:10:05,257 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 11:10:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:10:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:10:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:10:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:10:05,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:10:05,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:10:05,370 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:10:05,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:10:25,890 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-10-11 11:10:25,890 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:10:25,957 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:10:25,958 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:10:25,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:25 BoogieIcfgContainer [2024-10-11 11:10:25,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:10:25,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:10:25,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:10:25,964 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:10:25,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:10:04" (1/3) ... [2024-10-11 11:10:25,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40854595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:25, skipping insertion in model container [2024-10-11 11:10:25,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:10:05" (2/3) ... [2024-10-11 11:10:25,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40854595 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:10:25, skipping insertion in model container [2024-10-11 11:10:25,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:10:25" (3/3) ... [2024-10-11 11:10:25,966 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-72.i [2024-10-11 11:10:25,980 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:10:25,981 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:10:26,026 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:10:26,031 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;@7fe4633f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:10:26,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:10:26,034 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 11:10:26,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 11:10:26,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:26,051 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:26,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:26,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:26,057 INFO L85 PathProgramCache]: Analyzing trace with hash -389041652, now seen corresponding path program 1 times [2024-10-11 11:10:26,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:10:26,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880618711] [2024-10-11 11:10:26,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:26,069 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 11:10:26,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:10:26,072 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 11:10:26,102 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 11:10:27,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:27,537 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:10:27,558 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:27,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 824 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-10-11 11:10:27,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:10:27,662 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:10:27,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880618711] [2024-10-11 11:10:27,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880618711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:10:27,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:10:27,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:10:27,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829099545] [2024-10-11 11:10:27,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:10:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:10:27,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:10:27,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:10:27,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:10:27,719 INFO L87 Difference]: Start difference. First operand has 80 states, 48 states have (on average 1.4583333333333333) internal successors, (70), 49 states have internal predecessors, (70), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 11:10:32,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.48s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:10:32,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:10:32,525 INFO L93 Difference]: Finished difference Result 159 states and 284 transitions. [2024-10-11 11:10:32,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:10:32,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 183 [2024-10-11 11:10:32,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:10:32,538 INFO L225 Difference]: With dead ends: 159 [2024-10-11 11:10:32,538 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 11:10:32,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 182 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 11:10:32,544 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-10-11 11:10:32,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2024-10-11 11:10:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 11:10:32,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 11:10:32,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 29 states have call successors, (29), 1 states have call predecessors, (29), 1 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 11:10:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2024-10-11 11:10:32,601 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 183 [2024-10-11 11:10:32,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:10:32,603 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2024-10-11 11:10:32,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2024-10-11 11:10:32,603 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2024-10-11 11:10:32,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 11:10:32,608 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:10:32,608 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:10:32,641 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-11 11:10:32,812 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 11:10:32,814 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:10:32,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:10:32,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1810816526, now seen corresponding path program 1 times [2024-10-11 11:10:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:10:32,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744966133] [2024-10-11 11:10:32,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:10:32,821 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 11:10:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:10:32,825 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 11:10:32,827 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 11:10:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:10:34,219 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-11 11:10:34,231 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:10:41,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 334 proven. 75 refuted. 0 times theorem prover too weak. 1215 trivial. 0 not checked. [2024-10-11 11:10:41,064 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:10:46,032 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 9 proven. 75 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2024-10-11 11:10:46,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:10:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744966133] [2024-10-11 11:10:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744966133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 11:10:46,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:10:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-11 11:10:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663411410] [2024-10-11 11:10:46,036 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:10:46,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 11:10:46,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:10:46,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 11:10:46,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 11:10:46,042 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-11 11:10:54,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:10:58,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:02,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 11:11:02,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:11:02,870 INFO L93 Difference]: Finished difference Result 163 states and 252 transitions. [2024-10-11 11:11:02,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 11:11:02,876 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 183 [2024-10-11 11:11:02,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:11:02,878 INFO L225 Difference]: With dead ends: 163 [2024-10-11 11:11:02,878 INFO L226 Difference]: Without dead ends: 86 [2024-10-11 11:11:02,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 358 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 11:11:02,879 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 12 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2024-10-11 11:11:02,880 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 192 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 164 Invalid, 3 Unknown, 0 Unchecked, 16.2s Time] [2024-10-11 11:11:02,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-11 11:11:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 82. [2024-10-11 11:11:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.34) internal successors, (67), 50 states have internal predecessors, (67), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 29 states have call predecessors, (29), 29 states have call successors, (29) [2024-10-11 11:11:02,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 125 transitions. [2024-10-11 11:11:02,902 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 125 transitions. Word has length 183 [2024-10-11 11:11:02,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:11:02,903 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 125 transitions. [2024-10-11 11:11:02,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-10-11 11:11:02,904 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 125 transitions. [2024-10-11 11:11:02,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-11 11:11:02,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:11:02,909 INFO L215 NwaCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:11:02,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 11:11:03,109 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 11:11:03,110 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:11:03,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:11:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash -183328180, now seen corresponding path program 1 times [2024-10-11 11:11:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:11:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930057777] [2024-10-11 11:11:03,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:11:03,111 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 11:11:03,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:11:03,116 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 11:11:03,121 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 11:11:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:11:04,291 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 11:11:04,296 INFO L278 TraceCheckSpWp]: Computing forward predicates...