./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:14:11,578 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:14:11,671 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 02:14:11,676 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:14:11,678 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:14:11,706 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:14:11,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:14:11,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:14:11,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:14:11,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:14:11,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:14:11,710 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:14:11,711 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:14:11,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:14:11,714 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:14:11,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:14:11,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:14:11,715 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:14:11,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 02:14:11,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:14:11,716 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:14:11,716 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:14:11,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:14:11,717 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:14:11,717 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:14:11,717 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:14:11,718 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:14:11,718 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:14:11,718 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:14:11,719 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:14:11,719 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:14:11,719 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:14:11,720 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:11,720 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:14:11,720 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:14:11,720 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:14:11,721 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 02:14:11,721 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 02:14:11,721 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:14:11,722 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:14:11,722 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:14:11,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:14:11,723 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 [2024-10-13 02:14:11,989 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:14:12,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:14:12,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:14:12,019 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:14:12,019 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:14:12,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-10-13 02:14:13,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:14:13,670 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:14:13,670 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-10-13 02:14:13,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/157b3bc09/66b7a501361645a4b4a0a01dc9956fae/FLAG481275790 [2024-10-13 02:14:13,697 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/157b3bc09/66b7a501361645a4b4a0a01dc9956fae [2024-10-13 02:14:13,700 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:14:13,702 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:14:13,704 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:13,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:14:13,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:14:13,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:13" (1/1) ... [2024-10-13 02:14:13,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11a3d079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:13, skipping insertion in model container [2024-10-13 02:14:13,714 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:13" (1/1) ... [2024-10-13 02:14:13,750 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:14:13,940 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-10-13 02:14:14,024 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:14,042 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:14:14,053 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-10-13 02:14:14,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:14,179 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:14:14,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14 WrapperNode [2024-10-13 02:14:14,180 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:14,181 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:14,182 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:14:14,182 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:14:14,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,208 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,252 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 220 [2024-10-13 02:14:14,253 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:14,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:14:14,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:14:14,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:14:14,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,273 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,304 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-13 02:14:14,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,326 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,344 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,354 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,364 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:14:14,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:14:14,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:14:14,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:14:14,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (1/1) ... [2024-10-13 02:14:14,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:14,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:14,408 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:14:14,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:14:14,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:14:14,459 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:14:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:14:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 02:14:14,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:14:14,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:14:14,564 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:14:14,565 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:14:14,987 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:14:14,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:14:15,031 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:14:15,031 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:14:15,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:15 BoogieIcfgContainer [2024-10-13 02:14:15,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:14:15,033 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:14:15,033 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:14:15,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:14:15,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:14:13" (1/3) ... [2024-10-13 02:14:15,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693695d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:15, skipping insertion in model container [2024-10-13 02:14:15,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:14" (2/3) ... [2024-10-13 02:14:15,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693695d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:15, skipping insertion in model container [2024-10-13 02:14:15,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:15" (3/3) ... [2024-10-13 02:14:15,042 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-10-13 02:14:15,057 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:14:15,058 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:14:15,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:14:15,117 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;@31be5118, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:14:15,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:14:15,121 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:14:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:14:15,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:15,139 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:15,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:15,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:15,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1762800312, now seen corresponding path program 1 times [2024-10-13 02:14:15,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:15,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802121863] [2024-10-13 02:14:15,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:15,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:15,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:15,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:15,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:15,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:15,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:15,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:15,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:15,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:15,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:15,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:15,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802121863] [2024-10-13 02:14:15,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802121863] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:15,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:15,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:14:15,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319158606] [2024-10-13 02:14:15,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:15,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:14:15,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:15,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:14:15,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:14:15,717 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.462962962962963) internal successors, (79), 55 states have internal predecessors, (79), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 02:14:15,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:15,772 INFO L93 Difference]: Finished difference Result 167 states and 296 transitions. [2024-10-13 02:14:15,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:14:15,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 180 [2024-10-13 02:14:15,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:15,786 INFO L225 Difference]: With dead ends: 167 [2024-10-13 02:14:15,786 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 02:14:15,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 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-13 02:14:15,795 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:15,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:15,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 02:14:15,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 02:14:15,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3962264150943395) internal successors, (74), 53 states have internal predecessors, (74), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:14:15,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 130 transitions. [2024-10-13 02:14:15,848 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 130 transitions. Word has length 180 [2024-10-13 02:14:15,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:15,849 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 130 transitions. [2024-10-13 02:14:15,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 02:14:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 130 transitions. [2024-10-13 02:14:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:14:15,857 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:15,857 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:15,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 02:14:15,858 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:15,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1948430664, now seen corresponding path program 1 times [2024-10-13 02:14:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:15,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558445239] [2024-10-13 02:14:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:15,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:16,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:16,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:16,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:16,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:16,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:16,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:16,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:16,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:16,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:16,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:16,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:16,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:16,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:16,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:16,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:16,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:16,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558445239] [2024-10-13 02:14:16,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558445239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:16,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:16,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:14:16,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415097452] [2024-10-13 02:14:16,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:16,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:14:16,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:14:16,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:16,517 INFO L87 Difference]: Start difference. First operand 83 states and 130 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:16,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:16,569 INFO L93 Difference]: Finished difference Result 247 states and 388 transitions. [2024-10-13 02:14:16,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:14:16,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 02:14:16,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:16,574 INFO L225 Difference]: With dead ends: 247 [2024-10-13 02:14:16,574 INFO L226 Difference]: Without dead ends: 165 [2024-10-13 02:14:16,575 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:16,577 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 66 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:16,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 247 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:16,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-10-13 02:14:16,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2024-10-13 02:14:16,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.3846153846153846) internal successors, (144), 104 states have internal predecessors, (144), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:14:16,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 256 transitions. [2024-10-13 02:14:16,623 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 256 transitions. Word has length 180 [2024-10-13 02:14:16,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:16,624 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 256 transitions. [2024-10-13 02:14:16,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 256 transitions. [2024-10-13 02:14:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 02:14:16,629 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:16,629 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:16,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 02:14:16,630 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:16,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:16,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1382972754, now seen corresponding path program 1 times [2024-10-13 02:14:16,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:16,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189396623] [2024-10-13 02:14:16,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:16,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:17,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:17,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:17,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:17,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:17,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:17,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:17,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:17,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:17,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,145 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:17,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:17,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189396623] [2024-10-13 02:14:17,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189396623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:17,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:17,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 02:14:17,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470802320] [2024-10-13 02:14:17,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:17,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:14:17,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:14:17,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:14:17,151 INFO L87 Difference]: Start difference. First operand 163 states and 256 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:17,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:17,422 INFO L93 Difference]: Finished difference Result 355 states and 556 transitions. [2024-10-13 02:14:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:14:17,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-10-13 02:14:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:17,426 INFO L225 Difference]: With dead ends: 355 [2024-10-13 02:14:17,426 INFO L226 Difference]: Without dead ends: 193 [2024-10-13 02:14:17,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:14:17,428 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 163 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:17,429 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 435 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 02:14:17,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-10-13 02:14:17,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 163. [2024-10-13 02:14:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.375) internal successors, (143), 104 states have internal predecessors, (143), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:14:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 255 transitions. [2024-10-13 02:14:17,447 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 255 transitions. Word has length 181 [2024-10-13 02:14:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:17,448 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 255 transitions. [2024-10-13 02:14:17,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:17,449 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 255 transitions. [2024-10-13 02:14:17,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 02:14:17,451 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:17,451 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:17,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 02:14:17,452 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:17,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:17,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1381515400, now seen corresponding path program 1 times [2024-10-13 02:14:17,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:17,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126629935] [2024-10-13 02:14:17,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:17,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:17,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:17,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:17,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:17,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:17,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:17,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:17,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:17,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:17,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:17,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126629935] [2024-10-13 02:14:17,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126629935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:17,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:17,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:14:17,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507918233] [2024-10-13 02:14:17,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:17,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:14:17,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:17,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:14:17,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:17,718 INFO L87 Difference]: Start difference. First operand 163 states and 255 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:17,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:17,749 INFO L93 Difference]: Finished difference Result 350 states and 552 transitions. [2024-10-13 02:14:17,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:14:17,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-10-13 02:14:17,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:17,753 INFO L225 Difference]: With dead ends: 350 [2024-10-13 02:14:17,755 INFO L226 Difference]: Without dead ends: 188 [2024-10-13 02:14:17,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:17,760 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 43 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:17,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 289 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:17,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2024-10-13 02:14:17,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 163. [2024-10-13 02:14:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 104 states have internal predecessors, (141), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:14:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 253 transitions. [2024-10-13 02:14:17,791 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 253 transitions. Word has length 182 [2024-10-13 02:14:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:17,792 INFO L471 AbstractCegarLoop]: Abstraction has 163 states and 253 transitions. [2024-10-13 02:14:17,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:17,793 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 253 transitions. [2024-10-13 02:14:17,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-13 02:14:17,795 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:17,795 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:17,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 02:14:17,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:17,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:17,796 INFO L85 PathProgramCache]: Analyzing trace with hash -958813574, now seen corresponding path program 1 times [2024-10-13 02:14:17,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:17,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657837481] [2024-10-13 02:14:17,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:17,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:17,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:18,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:18,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:18,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:18,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:18,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:18,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:18,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657837481] [2024-10-13 02:14:18,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657837481] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:18,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:18,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:14:18,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345733867] [2024-10-13 02:14:18,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:18,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 02:14:18,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:18,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 02:14:18,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:14:18,139 INFO L87 Difference]: Start difference. First operand 163 states and 253 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:18,268 INFO L93 Difference]: Finished difference Result 379 states and 584 transitions. [2024-10-13 02:14:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 02:14:18,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 182 [2024-10-13 02:14:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:18,271 INFO L225 Difference]: With dead ends: 379 [2024-10-13 02:14:18,273 INFO L226 Difference]: Without dead ends: 217 [2024-10-13 02:14:18,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 02:14:18,275 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 35 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:18,275 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 370 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 02:14:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-10-13 02:14:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 213. [2024-10-13 02:14:18,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 144 states have (on average 1.3819444444444444) internal successors, (199), 146 states have internal predecessors, (199), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-13 02:14:18,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 327 transitions. [2024-10-13 02:14:18,302 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 327 transitions. Word has length 182 [2024-10-13 02:14:18,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:18,303 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 327 transitions. [2024-10-13 02:14:18,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 327 transitions. [2024-10-13 02:14:18,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 02:14:18,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:18,306 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:18,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 02:14:18,306 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:18,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:18,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1567288577, now seen corresponding path program 1 times [2024-10-13 02:14:18,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:18,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574716048] [2024-10-13 02:14:18,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:18,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:18,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:18,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:18,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:18,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:18,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:18,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:18,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:18,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:18,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:18,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:18,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:18,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:18,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:18,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:18,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574716048] [2024-10-13 02:14:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574716048] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:18,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:14:18,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570426092] [2024-10-13 02:14:18,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:18,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:14:18,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:18,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:14:18,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:18,512 INFO L87 Difference]: Start difference. First operand 213 states and 327 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:18,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:18,573 INFO L93 Difference]: Finished difference Result 440 states and 670 transitions. [2024-10-13 02:14:18,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:14:18,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-10-13 02:14:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:18,580 INFO L225 Difference]: With dead ends: 440 [2024-10-13 02:14:18,580 INFO L226 Difference]: Without dead ends: 228 [2024-10-13 02:14:18,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:18,584 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 55 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:18,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 194 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2024-10-13 02:14:18,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2024-10-13 02:14:18,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 112 states have (on average 1.3125) internal successors, (147), 113 states have internal predecessors, (147), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:14:18,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 267 transitions. [2024-10-13 02:14:18,607 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 267 transitions. Word has length 183 [2024-10-13 02:14:18,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:18,609 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 267 transitions. [2024-10-13 02:14:18,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 267 transitions. [2024-10-13 02:14:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-10-13 02:14:18,612 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:18,612 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:18,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 02:14:18,613 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:18,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:18,613 INFO L85 PathProgramCache]: Analyzing trace with hash -689633576, now seen corresponding path program 1 times [2024-10-13 02:14:18,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127006041] [2024-10-13 02:14:18,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 02:14:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 02:14:18,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 02:14:18,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 02:14:18,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 02:14:18,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 02:14:18,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 02:14:18,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 02:14:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 02:14:18,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-13 02:14:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 02:14:18,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-13 02:14:18,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-13 02:14:18,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-13 02:14:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 02:14:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-13 02:14:18,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 02:14:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-13 02:14:18,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 02:14:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-13 02:14:18,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-13 02:14:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-13 02:14:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-13 02:14:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-13 02:14:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-10-13 02:14:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-10-13 02:14:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-13 02:14:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-10-13 02:14:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:18,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:18,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:18,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127006041] [2024-10-13 02:14:18,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127006041] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:18,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:18,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:14:18,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605639544] [2024-10-13 02:14:18,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:18,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:14:18,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:18,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:14:18,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:18,866 INFO L87 Difference]: Start difference. First operand 177 states and 267 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:18,929 INFO L93 Difference]: Finished difference Result 349 states and 527 transitions. [2024-10-13 02:14:18,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:14:18,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 183 [2024-10-13 02:14:18,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:18,931 INFO L225 Difference]: With dead ends: 349 [2024-10-13 02:14:18,933 INFO L226 Difference]: Without dead ends: 179 [2024-10-13 02:14:18,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:14:18,934 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:18,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 232 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 02:14:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2024-10-13 02:14:18,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2024-10-13 02:14:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 114 states have (on average 1.3070175438596492) internal successors, (149), 115 states have internal predecessors, (149), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-10-13 02:14:18,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 269 transitions. [2024-10-13 02:14:18,960 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 269 transitions. Word has length 183 [2024-10-13 02:14:18,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 179 states and 269 transitions. [2024-10-13 02:14:18,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 269 transitions. [2024-10-13 02:14:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 02:14:18,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:18,965 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:18,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 02:14:18,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1922477811, now seen corresponding path program 1 times [2024-10-13 02:14:18,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:18,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535736396] [2024-10-13 02:14:18,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:14:19,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1152874510] [2024-10-13 02:14:19,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:19,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:19,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:19,069 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:14:19,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 02:14:19,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:19,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 02:14:19,361 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 477 proven. 66 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-10-13 02:14:19,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 02:14:20,289 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:20,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 02:14:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535736396] [2024-10-13 02:14:20,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 02:14:20,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152874510] [2024-10-13 02:14:20,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152874510] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-13 02:14:20,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 02:14:20,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2024-10-13 02:14:20,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771759678] [2024-10-13 02:14:20,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:20,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 02:14:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 02:14:20,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 02:14:20,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 02:14:20,294 INFO L87 Difference]: Start difference. First operand 179 states and 269 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:20,691 INFO L93 Difference]: Finished difference Result 410 states and 612 transitions. [2024-10-13 02:14:20,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:14:20,691 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-10-13 02:14:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:20,694 INFO L225 Difference]: With dead ends: 410 [2024-10-13 02:14:20,694 INFO L226 Difference]: Without dead ends: 232 [2024-10-13 02:14:20,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 357 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-13 02:14:20,696 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 133 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:20,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 326 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 02:14:20,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-13 02:14:20,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 173. [2024-10-13 02:14:20,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 112 states have (on average 1.3125) internal successors, (147), 112 states have internal predecessors, (147), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:14:20,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 259 transitions. [2024-10-13 02:14:20,722 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 259 transitions. Word has length 184 [2024-10-13 02:14:20,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:20,723 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 259 transitions. [2024-10-13 02:14:20,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 259 transitions. [2024-10-13 02:14:20,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-10-13 02:14:20,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:20,726 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:20,746 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 02:14:20,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:20,928 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:20,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:20,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1155667231, now seen corresponding path program 1 times [2024-10-13 02:14:20,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 02:14:20,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014049390] [2024-10-13 02:14:20,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:20,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 02:14:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 02:14:21,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [386801145] [2024-10-13 02:14:21,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:21,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 02:14:21,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:21,019 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 02:14:21,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 02:14:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:14:21,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 02:14:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 02:14:21,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 02:14:21,425 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 02:14:21,426 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 02:14:21,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:14:21,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-10-13 02:14:21,637 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:21,775 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 02:14:21,778 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 02:14:21 BoogieIcfgContainer [2024-10-13 02:14:21,778 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 02:14:21,779 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 02:14:21,779 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 02:14:21,779 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 02:14:21,779 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:15" (3/4) ... [2024-10-13 02:14:21,781 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 02:14:21,783 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 02:14:21,783 INFO L158 Benchmark]: Toolchain (without parser) took 8082.32ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 108.0MB in the beginning and 183.5MB in the end (delta: -75.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:14:21,783 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 111.1MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:14:21,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 476.35ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 146.7MB in the end (delta: -38.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 02:14:21,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.55ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 141.2MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 02:14:21,784 INFO L158 Benchmark]: Boogie Preprocessor took 111.59ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 132.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-13 02:14:21,785 INFO L158 Benchmark]: RCFGBuilder took 665.79ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 97.8MB in the end (delta: 34.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-13 02:14:21,785 INFO L158 Benchmark]: TraceAbstraction took 6744.65ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 97.1MB in the beginning and 183.5MB in the end (delta: -86.4MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. [2024-10-13 02:14:21,785 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 232.8MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 02:14:21,786 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.08ms. Allocated memory is still 111.1MB. Free memory is still 75.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 476.35ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 146.7MB in the end (delta: -38.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.55ms. Allocated memory is still 178.3MB. Free memory was 146.7MB in the beginning and 141.2MB in the end (delta: 5.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 111.59ms. Allocated memory is still 178.3MB. Free memory was 141.2MB in the beginning and 132.0MB in the end (delta: 9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 665.79ms. Allocated memory is still 178.3MB. Free memory was 132.0MB in the beginning and 97.8MB in the end (delta: 34.2MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6744.65ms. Allocated memory was 178.3MB in the beginning and 232.8MB in the end (delta: 54.5MB). Free memory was 97.1MB in the beginning and 183.5MB in the end (delta: -86.4MB). Peak memory consumption was 98.3MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 232.8MB. Free memory is still 183.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 192, overapproximation of someBinaryFLOATComparisonOperation at line 192, overapproximation of someBinaryArithmeticDOUBLEoperation at line 131. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] unsigned char var_1_2 = 1; [L24] unsigned char var_1_3 = 0; [L25] unsigned char var_1_7 = 50; [L26] unsigned char var_1_8 = 0; [L27] double var_1_9 = 127.625; [L28] double var_1_10 = 256.8; [L29] double var_1_11 = 0.30000000000000004; [L30] signed long int var_1_12 = -2; [L31] double var_1_13 = 2.475; [L32] double var_1_14 = 25.2; [L33] double var_1_15 = 500.125; [L34] double var_1_16 = 10.75; [L35] double var_1_17 = 255.4; [L36] unsigned char var_1_18 = 1; [L37] unsigned char var_1_19 = 0; [L38] unsigned char var_1_20 = 100; [L39] unsigned char var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned char var_1_23 = 1; [L42] unsigned char var_1_24 = 8; [L43] unsigned char var_1_25 = 10; [L44] float var_1_26 = 16.8; [L45] unsigned long int var_1_27 = 64; [L46] unsigned long int var_1_28 = 256; [L47] double var_1_32 = 255.5; [L48] signed long int var_1_36 = 4; [L49] double var_1_38 = 63.6; [L50] double var_1_40 = 0.0; [L51] signed short int var_1_42 = 128; [L52] unsigned char var_1_45 = 0; [L53] unsigned char var_1_48 = 0; [L54] float var_1_49 = 256.5; [L55] unsigned long int var_1_50 = 100; [L56] double var_1_51 = 63.5; [L57] unsigned char var_1_52 = 50; [L58] unsigned char last_1_var_1_18 = 1; [L59] unsigned char last_1_var_1_20 = 100; [L196] isInitial = 1 [L197] FCALL initially() [L198] COND TRUE 1 [L199] CALL updateLastVariables() [L188] last_1_var_1_18 = var_1_18 [L189] last_1_var_1_20 = var_1_20 [L199] RET updateLastVariables() [L200] CALL updateVariables() [L140] var_1_2 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L141] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L142] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L143] var_1_3 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L144] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L145] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=0, var_1_9=1021/8] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_9=1021/8] [L148] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L148] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=1284/5, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L149] var_1_10 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L150] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_11=7500000000000001/25000000000000000, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L151] var_1_11 = __VERIFIER_nondet_double() [L152] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L152] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_13=99/40, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L153] var_1_13 = __VERIFIER_nondet_double() [L154] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L154] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_14=126/5, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L155] var_1_14 = __VERIFIER_nondet_double() [L156] CALL assume_abort_if_not((var_1_14 >= 0.0F && 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_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L156] RET assume_abort_if_not((var_1_14 >= 0.0F && 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_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_15=4001/8, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L157] var_1_15 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_15 >= 0.0F && 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_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L158] RET assume_abort_if_not((var_1_15 >= 0.0F && 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_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_16=43/4, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L159] var_1_16 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L160] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427387900e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_17=1277/5, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L161] var_1_17 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L162] RET assume_abort_if_not((var_1_17 >= 0.0F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427387900e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L163] var_1_19 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L164] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L165] CALL assume_abort_if_not(var_1_19 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L165] RET assume_abort_if_not(var_1_19 <= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=128, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L166] var_1_21 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_21 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L167] RET assume_abort_if_not(var_1_21 >= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L168] CALL assume_abort_if_not(var_1_21 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L168] RET assume_abort_if_not(var_1_21 <= 254) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=0, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L169] var_1_22 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L170] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L171] CALL assume_abort_if_not(var_1_22 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L171] RET assume_abort_if_not(var_1_22 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=1, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L172] var_1_23 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L173] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L174] CALL assume_abort_if_not(var_1_23 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L174] RET assume_abort_if_not(var_1_23 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=8, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L175] var_1_24 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L176] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L177] CALL assume_abort_if_not(var_1_24 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L177] RET assume_abort_if_not(var_1_24 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=10, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L178] var_1_25 = __VERIFIER_nondet_uchar() [L179] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L179] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L180] CALL assume_abort_if_not(var_1_25 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L180] RET assume_abort_if_not(var_1_25 <= 127) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_40=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L181] var_1_40 = __VERIFIER_nondet_double() [L182] CALL assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L182] RET assume_abort_if_not((var_1_40 >= 4611686.018427382800e+12F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=0, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L183] var_1_48 = __VERIFIER_nondet_uchar() [L184] CALL assume_abort_if_not(var_1_48 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L184] RET assume_abort_if_not(var_1_48 >= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L185] CALL assume_abort_if_not(var_1_48 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L185] RET assume_abort_if_not(var_1_48 <= 1) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L200] RET updateVariables() [L201] CALL step() [L63] signed long int stepLocal_1 = last_1_var_1_20; [L64] unsigned char stepLocal_0 = last_1_var_1_18; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_0=1, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L65] COND TRUE stepLocal_0 && last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_1=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=50, var_1_8=-256, var_1_9=1021/8] [L66] COND FALSE !(((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > stepLocal_1) [L69] var_1_7 = var_1_8 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L74] COND FALSE !(\read(var_1_3)) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=4, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L79] var_1_36 = (((((var_1_8) > (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))))) ? (var_1_8) : (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7)))))) + var_1_7) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=513/2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L80] COND FALSE !(0.83f > var_1_10) [L85] var_1_49 = var_1_10 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=84/5, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L87] var_1_26 = var_1_16 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=64, var_1_28=256, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L88] COND TRUE (var_1_25 - var_1_23) <= var_1_8 [L89] var_1_28 = var_1_23 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=64, var_1_28=127, var_1_2=1, var_1_32=511/2, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=100, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L91] var_1_32 = ((((((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) > (var_1_16)) ? (((((var_1_16) < (var_1_17)) ? (var_1_16) : (var_1_17)))) : (var_1_16))) [L92] var_1_50 = var_1_8 [L93] var_1_27 = 10u VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L94] EXPR (var_1_8 * var_1_24) | var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L94] COND TRUE ((var_1_8 * var_1_24) | var_1_7) <= (var_1_7 + 8u) [L95] COND TRUE ((((16u) < (var_1_7)) ? (16u) : (var_1_7))) < var_1_24 [L96] var_1_45 = var_1_19 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=127/2, var_1_52=50, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L101] var_1_51 = var_1_11 [L102] var_1_52 = var_1_8 [L103] unsigned long int stepLocal_2 = var_1_27; VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, stepLocal_2=10, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=1021/8] [L104] COND TRUE stepLocal_2 != (var_1_8 + var_1_7) [L105] var_1_9 = ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L109] COND TRUE var_1_8 >= var_1_7 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=100, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L110] COND TRUE var_1_15 >= var_1_26 [L111] var_1_20 = (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=128, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L118] COND TRUE ! (var_1_11 >= (var_1_16 - var_1_40)) [L119] var_1_42 = (((((var_1_24 - 256)) < (var_1_24)) ? ((var_1_24 - 256)) : (var_1_24))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L121] COND TRUE \read(var_1_18) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L122] COND FALSE !(! var_1_18) [L125] var_1_1 = (var_1_20 - var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L130] EXPR -10 >> var_1_20 VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_38=318/5, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L130] COND TRUE 256 > (-10 >> var_1_20) [L131] var_1_38 = (var_1_16 - (((((var_1_40 - 128.375)) < (var_1_17)) ? ((var_1_40 - 128.375)) : (var_1_17)))) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=-2, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L135] COND TRUE (var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17)) [L136] var_1_12 = (var_1_20 + var_1_20) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L201] RET step() [L202] CALL, EXPR property() [L192-L193] return (((((((var_1_18 ? ((! var_1_18) ? (var_1_1 == ((signed short int) (var_1_7 + 5))) : (var_1_1 == ((signed short int) (var_1_20 - var_1_20)))) : (var_1_1 == ((signed short int) var_1_20))) && ((last_1_var_1_18 && last_1_var_1_18) ? ((((((last_1_var_1_20) < ((last_1_var_1_20 * last_1_var_1_20))) ? (last_1_var_1_20) : ((last_1_var_1_20 * last_1_var_1_20)))) > last_1_var_1_20) ? (var_1_7 == ((unsigned char) var_1_8)) : (var_1_7 == ((unsigned char) var_1_8))) : (var_1_7 == ((unsigned char) var_1_8)))) && ((var_1_27 != (var_1_8 + var_1_7)) ? (var_1_9 == ((double) ((((var_1_10) < (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6))))) ? (var_1_10) : (((((var_1_11) < (32.6)) ? (var_1_11) : (32.6)))))))) : (var_1_9 == ((double) ((((var_1_11) < (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) ? (var_1_11) : (((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10)))))))))) && (((var_1_13 - var_1_14) >= (var_1_15 - (var_1_16 + var_1_17))) ? (var_1_12 == ((signed long int) (var_1_20 + var_1_20))) : 1)) && (var_1_3 ? (var_1_2 ? (var_1_18 == ((unsigned char) (! var_1_19))) : 1) : 1)) && ((var_1_8 >= var_1_7) ? ((var_1_15 >= var_1_26) ? (var_1_20 == ((unsigned char) (var_1_21 - ((((((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) > (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))) ? (((((var_1_22) < (var_1_23)) ? (var_1_22) : (var_1_23)))) : (((((var_1_24) < (var_1_25)) ? (var_1_24) : (var_1_25))))))))) : (var_1_20 == ((unsigned char) var_1_24))) : (var_1_20 == ((unsigned char) var_1_22)))) && (var_1_26 == ((float) var_1_16))) && (var_1_27 == ((unsigned long int) 10u)) ; [L202] RET, EXPR property() [L202] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=1, last_1_var_1_20=100, var_1_10=2, var_1_11=4, var_1_12=0, var_1_16=3, var_1_17=0, var_1_18=1, var_1_19=0, var_1_1=0, var_1_20=0, var_1_21=127, var_1_22=127, var_1_23=-385, var_1_24=127, var_1_25=-129, var_1_26=3, var_1_27=10, var_1_28=127, var_1_2=1, var_1_32=3, var_1_36=0, var_1_3=0, var_1_42=-129, var_1_45=0, var_1_48=1, var_1_49=2, var_1_50=0, var_1_51=4, var_1_52=-256, var_1_7=-256, var_1_8=-256, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 85 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 495 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 495 mSDsluCounter, 2220 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1184 mSDsCounter, 92 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 431 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 92 mSolverCounterUnsat, 1036 mSDtfsCounter, 431 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 794 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 171 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2007 NumberOfCodeBlocks, 2007 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1630 ConstructedInterpolants, 7 QuantifiedInterpolants, 2734 SizeOfPredicates, 3 NumberOfNonLiveVariables, 441 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 13542/13608 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-13 02:14:21,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 02:14:24,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 02:14:24,235 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 02:14:24,243 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 02:14:24,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 02:14:24,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 02:14:24,280 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 02:14:24,281 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 02:14:24,282 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 02:14:24,283 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 02:14:24,283 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 02:14:24,284 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 02:14:24,284 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 02:14:24,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 02:14:24,287 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 02:14:24,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 02:14:24,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 02:14:24,288 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 02:14:24,288 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 02:14:24,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 02:14:24,292 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 02:14:24,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 02:14:24,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 02:14:24,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 02:14:24,294 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 02:14:24,294 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 02:14:24,294 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 02:14:24,294 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 02:14:24,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 02:14:24,295 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 02:14:24,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 02:14:24,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 02:14:24,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 02:14:24,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 02:14:24,297 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:24,298 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 02:14:24,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 02:14:24,299 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 02:14:24,300 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 02:14:24,300 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 02:14:24,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 02:14:24,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 02:14:24,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 02:14:24,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 02:14:24,301 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 02:14:24,301 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b80f3f9a0690b8b137c3e78a4bda741a5ebccde814b37d3c17d2da8a165237b2 [2024-10-13 02:14:24,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 02:14:24,702 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 02:14:24,706 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 02:14:24,708 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 02:14:24,708 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 02:14:24,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-10-13 02:14:26,286 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 02:14:26,533 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 02:14:26,534 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-10-13 02:14:26,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99799e92/2d43c31d8eb542cf98ef782d41f4e507/FLAG5577fa568 [2024-10-13 02:14:26,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f99799e92/2d43c31d8eb542cf98ef782d41f4e507 [2024-10-13 02:14:26,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 02:14:26,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 02:14:26,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:26,579 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 02:14:26,584 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 02:14:26,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:26" (1/1) ... [2024-10-13 02:14:26,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6db8caae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:26, skipping insertion in model container [2024-10-13 02:14:26,588 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 02:14:26" (1/1) ... [2024-10-13 02:14:26,620 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 02:14:26,830 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-10-13 02:14:26,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:26,937 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 02:14:26,953 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i[919,932] [2024-10-13 02:14:27,003 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 02:14:27,024 INFO L204 MainTranslator]: Completed translation [2024-10-13 02:14:27,025 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27 WrapperNode [2024-10-13 02:14:27,025 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 02:14:27,026 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:27,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 02:14:27,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 02:14:27,033 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,092 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 204 [2024-10-13 02:14:27,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 02:14:27,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 02:14:27,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 02:14:27,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 02:14:27,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,120 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,144 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-13 02:14:27,145 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,145 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,166 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,173 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,180 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,183 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 02:14:27,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 02:14:27,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 02:14:27,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 02:14:27,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (1/1) ... [2024-10-13 02:14:27,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 02:14:27,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 02:14:27,231 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 02:14:27,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 02:14:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 02:14:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 02:14:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 02:14:27,283 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 02:14:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 02:14:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 02:14:27,405 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 02:14:27,408 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 02:14:36,969 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-13 02:14:36,970 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 02:14:37,025 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 02:14:37,026 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 02:14:37,027 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:37 BoogieIcfgContainer [2024-10-13 02:14:37,027 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 02:14:37,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 02:14:37,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 02:14:37,032 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 02:14:37,043 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 02:14:26" (1/3) ... [2024-10-13 02:14:37,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696e550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:37, skipping insertion in model container [2024-10-13 02:14:37,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 02:14:27" (2/3) ... [2024-10-13 02:14:37,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@696e550c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 02:14:37, skipping insertion in model container [2024-10-13 02:14:37,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 02:14:37" (3/3) ... [2024-10-13 02:14:37,048 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-79.i [2024-10-13 02:14:37,065 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 02:14:37,065 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 02:14:37,132 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 02:14:37,139 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;@3ca9404c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 02:14:37,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 02:14:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:14:37,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 02:14:37,154 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:37,154 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:37,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -2015241904, now seen corresponding path program 1 times [2024-10-13 02:14:37,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:14:37,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [398521825] [2024-10-13 02:14:37,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:37,172 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-13 02:14:37,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:14:37,175 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:14:37,176 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 02:14:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:37,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 02:14:37,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:37,814 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2024-10-13 02:14:37,814 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:14:37,815 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:14:37,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [398521825] [2024-10-13 02:14:37,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [398521825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:37,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:37,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 02:14:37,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621033699] [2024-10-13 02:14:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:37,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 02:14:37,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:14:37,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 02:14:37,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 02:14:37,850 INFO L87 Difference]: Start difference. First operand has 80 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 50 states have internal predecessors, (71), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 02:14:42,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:14:42,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:42,031 INFO L93 Difference]: Finished difference Result 157 states and 280 transitions. [2024-10-13 02:14:42,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 02:14:42,061 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 178 [2024-10-13 02:14:42,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:42,067 INFO L225 Difference]: With dead ends: 157 [2024-10-13 02:14:42,067 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 02:14:42,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 177 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-13 02:14:42,072 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:42,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2024-10-13 02:14:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 02:14:42,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 02:14:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 48 states have internal predecessors, (65), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 02:14:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-13 02:14:42,113 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 178 [2024-10-13 02:14:42,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:42,114 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-13 02:14:42,114 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, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-10-13 02:14:42,115 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-13 02:14:42,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-10-13 02:14:42,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:42,119 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:42,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 02:14:42,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:14:42,320 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:42,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:42,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1728351454, now seen corresponding path program 1 times [2024-10-13 02:14:42,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:14:42,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2126041465] [2024-10-13 02:14:42,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:42,323 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-13 02:14:42,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:14:42,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:14:42,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 02:14:42,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:42,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:14:42,922 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:44,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:44,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:14:44,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:14:44,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2126041465] [2024-10-13 02:14:44,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2126041465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:44,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:44,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:14:44,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396209522] [2024-10-13 02:14:44,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:44,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:14:44,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:14:44,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:14:44,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:14:44,472 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:48,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.28s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:14:51,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:14:51,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:14:51,778 INFO L93 Difference]: Finished difference Result 255 states and 396 transitions. [2024-10-13 02:14:51,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:14:51,810 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 178 [2024-10-13 02:14:51,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:14:51,814 INFO L225 Difference]: With dead ends: 255 [2024-10-13 02:14:51,814 INFO L226 Difference]: Without dead ends: 178 [2024-10-13 02:14:51,815 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:14:51,816 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 133 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2024-10-13 02:14:51,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 399 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2024-10-13 02:14:51,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-10-13 02:14:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 153. [2024-10-13 02:14:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-13 02:14:51,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 237 transitions. [2024-10-13 02:14:51,858 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 237 transitions. Word has length 178 [2024-10-13 02:14:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:14:51,859 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 237 transitions. [2024-10-13 02:14:51,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 237 transitions. [2024-10-13 02:14:51,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:14:51,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:14:51,862 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:14:51,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 02:14:52,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:14:52,064 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:14:52,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:14:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 2055299926, now seen corresponding path program 1 times [2024-10-13 02:14:52,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:14:52,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022749717] [2024-10-13 02:14:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:14:52,065 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-13 02:14:52,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:14:52,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:14:52,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-13 02:14:52,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:14:52,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 02:14:52,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:14:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:14:54,239 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:14:54,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:14:54,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022749717] [2024-10-13 02:14:54,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1022749717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:14:54,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:14:54,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 02:14:54,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132522237] [2024-10-13 02:14:54,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:14:54,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 02:14:54,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:14:54,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 02:14:54,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 02:14:54,245 INFO L87 Difference]: Start difference. First operand 153 states and 237 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:14:58,947 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:15:03,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:15:04,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:15:08,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:15:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:15:08,688 INFO L93 Difference]: Finished difference Result 404 states and 625 transitions. [2024-10-13 02:15:08,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 02:15:08,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 02:15:08,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:15:08,741 INFO L225 Difference]: With dead ends: 404 [2024-10-13 02:15:08,742 INFO L226 Difference]: Without dead ends: 252 [2024-10-13 02:15:08,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 02:15:08,750 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 84 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 57 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-10-13 02:15:08,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 399 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 77 Invalid, 2 Unknown, 0 Unchecked, 14.3s Time] [2024-10-13 02:15:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2024-10-13 02:15:08,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 206. [2024-10-13 02:15:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 118 states have (on average 1.2627118644067796) internal successors, (149), 118 states have internal predecessors, (149), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 02:15:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 317 transitions. [2024-10-13 02:15:08,824 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 317 transitions. Word has length 180 [2024-10-13 02:15:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:15:08,825 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 317 transitions. [2024-10-13 02:15:08,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:15:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 317 transitions. [2024-10-13 02:15:08,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-10-13 02:15:08,828 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:15:08,828 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:15:08,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 02:15:09,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:15:09,029 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:15:09,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:15:09,030 INFO L85 PathProgramCache]: Analyzing trace with hash 366356184, now seen corresponding path program 1 times [2024-10-13 02:15:09,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:15:09,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752150583] [2024-10-13 02:15:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:15:09,031 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-13 02:15:09,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:15:09,035 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:15:09,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-13 02:15:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:15:09,596 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 02:15:09,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 02:15:09,731 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-10-13 02:15:09,731 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 02:15:09,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 02:15:09,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752150583] [2024-10-13 02:15:09,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752150583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 02:15:09,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 02:15:09,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 02:15:09,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254244672] [2024-10-13 02:15:09,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 02:15:09,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 02:15:09,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 02:15:09,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 02:15:09,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:15:09,735 INFO L87 Difference]: Start difference. First operand 206 states and 317 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:15:14,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 02:15:14,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 02:15:14,213 INFO L93 Difference]: Finished difference Result 366 states and 559 transitions. [2024-10-13 02:15:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 02:15:14,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-10-13 02:15:14,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 02:15:14,219 INFO L225 Difference]: With dead ends: 366 [2024-10-13 02:15:14,221 INFO L226 Difference]: Without dead ends: 214 [2024-10-13 02:15:14,222 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 02:15:14,223 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 41 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-13 02:15:14,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 190 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-13 02:15:14,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-10-13 02:15:14,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2024-10-13 02:15:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 124 states have (on average 1.2338709677419355) internal successors, (153), 124 states have internal predecessors, (153), 84 states have call successors, (84), 5 states have call predecessors, (84), 5 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-10-13 02:15:14,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 321 transitions. [2024-10-13 02:15:14,279 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 321 transitions. Word has length 180 [2024-10-13 02:15:14,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 02:15:14,281 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 321 transitions. [2024-10-13 02:15:14,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-10-13 02:15:14,282 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 321 transitions. [2024-10-13 02:15:14,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-10-13 02:15:14,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 02:15:14,288 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 02:15:14,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-10-13 02:15:14,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 02:15:14,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 02:15:14,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 02:15:14,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1208293870, now seen corresponding path program 1 times [2024-10-13 02:15:14,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 02:15:14,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2077980222] [2024-10-13 02:15:14,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 02:15:14,491 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-13 02:15:14,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 02:15:14,492 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 02:15:14,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-13 02:15:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 02:15:15,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-13 02:15:15,143 INFO L278 TraceCheckSpWp]: Computing forward predicates...