./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.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 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:34:52,769 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:34:52,835 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 21:34:52,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:34:52,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:34:52,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:34:52,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:34:52,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:34:52,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:34:52,865 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:34:52,865 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:34:52,866 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:34:52,866 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:34:52,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:34:52,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:34:52,867 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:34:52,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:52,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:34:52,868 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 [2025-03-03 21:34:53,099 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:34:53,107 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:34:53,109 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:34:53,110 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:34:53,110 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:34:53,111 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2025-03-03 21:34:54,278 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea478f66/9690400bb60342c89c98dd0bf4b2f508/FLAGb6e86a896 [2025-03-03 21:34:54,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:34:54,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2025-03-03 21:34:54,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea478f66/9690400bb60342c89c98dd0bf4b2f508/FLAGb6e86a896 [2025-03-03 21:34:54,609 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea478f66/9690400bb60342c89c98dd0bf4b2f508 [2025-03-03 21:34:54,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:34:54,614 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:34:54,617 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:54,617 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:34:54,621 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:34:54,622 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,623 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@298dd8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54, skipping insertion in model container [2025-03-03 21:34:54,623 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,643 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:34:54,758 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2025-03-03 21:34:54,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:54,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:34:54,850 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2025-03-03 21:34:54,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:34:54,888 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:34:54,889 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54 WrapperNode [2025-03-03 21:34:54,889 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:34:54,890 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:54,890 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:34:54,890 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:34:54,895 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,905 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,938 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2025-03-03 21:34:54,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:34:54,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:34:54,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:34:54,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:34:54,947 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,949 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,963 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]. [2025-03-03 21:34:54,966 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,966 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,971 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,972 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,973 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,975 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:34:54,976 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:34:54,976 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:34:54,976 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:34:54,977 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (1/1) ... [2025-03-03 21:34:54,981 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:34:54,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:55,005 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) [2025-03-03 21:34:55,007 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 [2025-03-03 21:34:55,024 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:34:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:34:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:34:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 21:34:55,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:34:55,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:34:55,093 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:34:55,094 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:34:55,413 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:34:55,414 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:34:55,423 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:34:55,423 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:34:55,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:55 BoogieIcfgContainer [2025-03-03 21:34:55,423 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:34:55,425 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:34:55,425 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:34:55,431 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:34:55,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:34:54" (1/3) ... [2025-03-03 21:34:55,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770b4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:55, skipping insertion in model container [2025-03-03 21:34:55,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:34:54" (2/3) ... [2025-03-03 21:34:55,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3770b4b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:34:55, skipping insertion in model container [2025-03-03 21:34:55,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:55" (3/3) ... [2025-03-03 21:34:55,433 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2025-03-03 21:34:55,446 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:34:55,447 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:34:55,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:34:55,498 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;@499a4a49, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:34:55,498 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:34:55,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:34:55,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:34:55,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:55,513 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:55,513 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:55,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1557124255, now seen corresponding path program 1 times [2025-03-03 21:34:55,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:55,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728586178] [2025-03-03 21:34:55,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:55,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:55,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:34:55,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:34:55,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:55,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:55,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 21:34:55,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:55,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728586178] [2025-03-03 21:34:55,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728586178] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:55,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311547362] [2025-03-03 21:34:55,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:55,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:55,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:55,819 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) [2025-03-03 21:34:55,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 21:34:55,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:34:55,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:34:55,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:55,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:55,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:34:55,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:56,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-03-03 21:34:56,020 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:34:56,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311547362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:56,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 21:34:56,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 21:34:56,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694439704] [2025-03-03 21:34:56,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:56,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:34:56,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:56,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:34:56,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:56,048 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:34:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:56,076 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2025-03-03 21:34:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:34:56,078 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-03 21:34:56,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:56,099 INFO L225 Difference]: With dead ends: 160 [2025-03-03 21:34:56,099 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 21:34:56,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:34:56,107 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:56,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:56,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 21:34:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 21:34:56,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:34:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-03-03 21:34:56,136 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 156 [2025-03-03 21:34:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:56,136 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-03-03 21:34:56,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:34:56,136 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-03-03 21:34:56,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:34:56,139 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:56,139 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:56,147 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 21:34:56,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 21:34:56,343 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:56,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:56,344 INFO L85 PathProgramCache]: Analyzing trace with hash 733717316, now seen corresponding path program 1 times [2025-03-03 21:34:56,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:56,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670348509] [2025-03-03 21:34:56,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:56,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:56,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:34:56,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:34:56,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:56,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:56,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:34:56,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:56,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670348509] [2025-03-03 21:34:56,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670348509] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:56,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:56,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:34:56,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467160984] [2025-03-03 21:34:56,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:56,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:34:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:56,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:34:56,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:34:56,586 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:56,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:56,641 INFO L93 Difference]: Finished difference Result 209 states and 315 transitions. [2025-03-03 21:34:56,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:34:56,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 156 [2025-03-03 21:34:56,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:56,644 INFO L225 Difference]: With dead ends: 209 [2025-03-03 21:34:56,644 INFO L226 Difference]: Without dead ends: 133 [2025-03-03 21:34:56,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:34:56,646 INFO L435 NwaCegarLoop]: 159 mSDtfsCounter, 66 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:56,646 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 260 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2025-03-03 21:34:56,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2025-03-03 21:34:56,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.3333333333333333) internal successors, (120), 91 states have internal predecessors, (120), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-03 21:34:56,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 194 transitions. [2025-03-03 21:34:56,665 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 194 transitions. Word has length 156 [2025-03-03 21:34:56,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:56,666 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 194 transitions. [2025-03-03 21:34:56,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:56,666 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 194 transitions. [2025-03-03 21:34:56,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 21:34:56,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:56,668 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:56,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 21:34:56,668 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:56,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:56,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1303708613, now seen corresponding path program 1 times [2025-03-03 21:34:56,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:56,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768757086] [2025-03-03 21:34:56,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:56,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-03 21:34:56,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 21:34:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:56,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:34:56,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:56,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768757086] [2025-03-03 21:34:56,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768757086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:56,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:56,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:34:56,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761207449] [2025-03-03 21:34:56,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:56,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:34:56,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:56,945 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:34:56,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:34:56,946 INFO L87 Difference]: Start difference. First operand 130 states and 194 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:57,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:57,135 INFO L93 Difference]: Finished difference Result 359 states and 538 transitions. [2025-03-03 21:34:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:34:57,135 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 157 [2025-03-03 21:34:57,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:57,140 INFO L225 Difference]: With dead ends: 359 [2025-03-03 21:34:57,142 INFO L226 Difference]: Without dead ends: 232 [2025-03-03 21:34:57,144 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:34:57,146 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 93 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:57,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 331 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:34:57,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2025-03-03 21:34:57,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 193. [2025-03-03 21:34:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 129 states have (on average 1.310077519379845) internal successors, (169), 130 states have internal predecessors, (169), 60 states have call successors, (60), 3 states have call predecessors, (60), 3 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 21:34:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 289 transitions. [2025-03-03 21:34:57,185 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 289 transitions. Word has length 157 [2025-03-03 21:34:57,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:57,186 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 289 transitions. [2025-03-03 21:34:57,186 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:57,186 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 289 transitions. [2025-03-03 21:34:57,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:34:57,190 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:57,190 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:57,190 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 21:34:57,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:57,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:57,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1329701386, now seen corresponding path program 1 times [2025-03-03 21:34:57,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:57,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974641578] [2025-03-03 21:34:57,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:57,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:57,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:34:57,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:34:57,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:57,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:57,426 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:34:57,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:57,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974641578] [2025-03-03 21:34:57,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974641578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:57,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:57,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:34:57,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942443494] [2025-03-03 21:34:57,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:57,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:34:57,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:57,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:34:57,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:34:57,429 INFO L87 Difference]: Start difference. First operand 193 states and 289 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:57,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:57,496 INFO L93 Difference]: Finished difference Result 458 states and 686 transitions. [2025-03-03 21:34:57,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:34:57,497 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2025-03-03 21:34:57,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:57,500 INFO L225 Difference]: With dead ends: 458 [2025-03-03 21:34:57,502 INFO L226 Difference]: Without dead ends: 319 [2025-03-03 21:34:57,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:34:57,504 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 66 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:57,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 233 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:34:57,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2025-03-03 21:34:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2025-03-03 21:34:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 214 states have (on average 1.280373831775701) internal successors, (274), 216 states have internal predecessors, (274), 97 states have call successors, (97), 5 states have call predecessors, (97), 5 states have return successors, (97), 95 states have call predecessors, (97), 97 states have call successors, (97) [2025-03-03 21:34:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 468 transitions. [2025-03-03 21:34:57,540 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 468 transitions. Word has length 158 [2025-03-03 21:34:57,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:57,540 INFO L471 AbstractCegarLoop]: Abstraction has 317 states and 468 transitions. [2025-03-03 21:34:57,540 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, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:57,541 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 468 transitions. [2025-03-03 21:34:57,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:34:57,542 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:57,542 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:57,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 21:34:57,542 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:57,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash 485229515, now seen corresponding path program 1 times [2025-03-03 21:34:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129361641] [2025-03-03 21:34:57,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:57,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:57,560 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:34:57,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:34:57,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:57,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:34:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129361641] [2025-03-03 21:34:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129361641] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 21:34:57,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944411369] [2025-03-03 21:34:57,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:57,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:57,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:34:57,820 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) [2025-03-03 21:34:57,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 21:34:57,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:34:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:34:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:57,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:57,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:34:57,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:34:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 21:34:58,069 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:34:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:34:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944411369] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:34:58,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 21:34:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-03 21:34:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498558765] [2025-03-03 21:34:58,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 21:34:58,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:34:58,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:58,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:34:58,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:34:58,266 INFO L87 Difference]: Start difference. First operand 317 states and 468 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:34:58,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:58,468 INFO L93 Difference]: Finished difference Result 479 states and 701 transitions. [2025-03-03 21:34:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 21:34:58,469 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 158 [2025-03-03 21:34:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:58,471 INFO L225 Difference]: With dead ends: 479 [2025-03-03 21:34:58,472 INFO L226 Difference]: Without dead ends: 221 [2025-03-03 21:34:58,477 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2025-03-03 21:34:58,478 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 123 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:58,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 192 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:34:58,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-03-03 21:34:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 215. [2025-03-03 21:34:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 139 states have (on average 1.1870503597122302) internal successors, (165), 139 states have internal predecessors, (165), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 21:34:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 303 transitions. [2025-03-03 21:34:58,507 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 303 transitions. Word has length 158 [2025-03-03 21:34:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:58,508 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 303 transitions. [2025-03-03 21:34:58,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:34:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 303 transitions. [2025-03-03 21:34:58,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:34:58,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:58,511 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:58,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 21:34:58,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 21:34:58,711 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:58,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:58,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1658042720, now seen corresponding path program 1 times [2025-03-03 21:34:58,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:58,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122128949] [2025-03-03 21:34:58,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:58,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:58,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:34:58,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:34:58,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:58,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:34:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:34:58,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 21:34:58,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122128949] [2025-03-03 21:34:58,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122128949] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:34:58,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:34:58,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 21:34:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401737206] [2025-03-03 21:34:58,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:34:58,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:34:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 21:34:58,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:34:58,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:34:58,936 INFO L87 Difference]: Start difference. First operand 215 states and 303 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:34:59,056 INFO L93 Difference]: Finished difference Result 304 states and 422 transitions. [2025-03-03 21:34:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:34:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 159 [2025-03-03 21:34:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:34:59,059 INFO L225 Difference]: With dead ends: 304 [2025-03-03 21:34:59,059 INFO L226 Difference]: Without dead ends: 227 [2025-03-03 21:34:59,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:34:59,060 INFO L435 NwaCegarLoop]: 92 mSDtfsCounter, 120 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 21:34:59,060 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 117 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 21:34:59,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2025-03-03 21:34:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 148. [2025-03-03 21:34:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.1368421052631579) internal successors, (108), 95 states have internal predecessors, (108), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:34:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 200 transitions. [2025-03-03 21:34:59,080 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 200 transitions. Word has length 159 [2025-03-03 21:34:59,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:34:59,081 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 200 transitions. [2025-03-03 21:34:59,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 4 states have internal predecessors, (47), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:34:59,081 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 200 transitions. [2025-03-03 21:34:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:34:59,082 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:34:59,082 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:59,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 21:34:59,082 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:34:59,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:34:59,083 INFO L85 PathProgramCache]: Analyzing trace with hash -149411743, now seen corresponding path program 1 times [2025-03-03 21:34:59,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 21:34:59,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391719156] [2025-03-03 21:34:59,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:34:59,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 21:34:59,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:34:59,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:34:59,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:59,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:34:59,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 21:34:59,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:34:59,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:34:59,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:34:59,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 21:34:59,302 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 21:34:59,302 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 21:34:59,303 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 21:34:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 21:34:59,309 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:34:59,431 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 21:34:59,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 09:34:59 BoogieIcfgContainer [2025-03-03 21:34:59,434 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 21:34:59,434 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 21:34:59,435 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 21:34:59,435 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 21:34:59,435 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:34:55" (3/4) ... [2025-03-03 21:34:59,437 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 21:34:59,438 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 21:34:59,438 INFO L158 Benchmark]: Toolchain (without parser) took 4824.24ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 124.0MB in the beginning and 205.1MB in the end (delta: -81.2MB). Peak memory consumption was 121.1MB. Max. memory is 16.1GB. [2025-03-03 21:34:59,439 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:59,439 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.86ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 108.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-03 21:34:59,439 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.94ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:59,439 INFO L158 Benchmark]: Boogie Preprocessor took 35.60ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:59,439 INFO L158 Benchmark]: IcfgBuilder took 447.70ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 82.5MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-03 21:34:59,439 INFO L158 Benchmark]: TraceAbstraction took 4009.17ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 81.6MB in the beginning and 205.2MB in the end (delta: -123.6MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2025-03-03 21:34:59,440 INFO L158 Benchmark]: Witness Printer took 3.19ms. Allocated memory is still 369.1MB. Free memory was 205.2MB in the beginning and 205.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 21:34:59,441 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.22ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 272.86ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 108.6MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.94ms. Allocated memory is still 167.8MB. Free memory was 108.6MB in the beginning and 106.7MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 35.60ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 103.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 447.70ms. Allocated memory is still 167.8MB. Free memory was 103.9MB in the beginning and 82.5MB in the end (delta: 21.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4009.17ms. Allocated memory was 167.8MB in the beginning and 369.1MB in the end (delta: 201.3MB). Free memory was 81.6MB in the beginning and 205.2MB in the end (delta: -123.6MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. * Witness Printer took 3.19ms. Allocated memory is still 369.1MB. Free memory was 205.2MB in the beginning and 205.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 154, overapproximation of someBinaryFLOATComparisonOperation at line 168, overapproximation of someBinaryFLOATComparisonOperation at line 152, overapproximation of someBinaryFLOATComparisonOperation at line 108, overapproximation of someBinaryFLOATComparisonOperation at line 170, overapproximation of someBinaryFLOATComparisonOperation at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 80, overapproximation of someBinaryDOUBLEComparisonOperation at line 114, overapproximation of someBinaryDOUBLEComparisonOperation at line 196, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 185, overapproximation of someBinaryDOUBLEComparisonOperation at line 126, overapproximation of someBinaryDOUBLEComparisonOperation at line 172. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed short int var_1_26 = 10; [L43] signed long int var_1_34 = -10; [L44] double var_1_36 = 4.85; [L45] double var_1_38 = 15.75; [L46] signed char var_1_39 = -100; [L47] signed short int var_1_41 = -32; [L48] signed char var_1_42 = 4; [L49] signed char var_1_43 = -8; [L50] signed short int var_1_44 = -25; [L51] signed char last_1_var_1_10 = -5; [L52] signed long int last_1_var_1_21 = 1; [L53] signed long int last_1_var_1_25 = -4; VAL [isInitial=0, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L200] isInitial = 1 [L201] FCALL initially() [L202] COND TRUE 1 [L203] CALL updateLastVariables() [L191] last_1_var_1_10 = var_1_10 [L192] last_1_var_1_21 = var_1_21 [L193] last_1_var_1_25 = var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_3=162/5, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L203] RET updateLastVariables() [L204] CALL updateVariables() [L151] var_1_3 = __VERIFIER_nondet_float() [L152] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L152] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L153] var_1_4 = __VERIFIER_nondet_float() [L154] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L154] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=10, var_1_8=64, var_1_9=256] [L155] var_1_7 = __VERIFIER_nondet_short() [L156] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L156] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L157] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=64, var_1_9=256] [L158] var_1_8 = __VERIFIER_nondet_short() [L159] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L159] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L160] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L160] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=256] [L161] var_1_9 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L162] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L163] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L163] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L164] var_1_11 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L165] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L166] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L166] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L167] var_1_13 = __VERIFIER_nondet_float() [L168] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L168] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && 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_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L169] var_1_14 = __VERIFIER_nondet_float() [L170] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L170] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L171] var_1_15 = __VERIFIER_nondet_double() [L172] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L172] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L173] var_1_16 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L174] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L175] var_1_20 = __VERIFIER_nondet_uchar() [L176] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L176] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L177] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L177] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L178] var_1_22 = __VERIFIER_nondet_short() [L179] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L179] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L180] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L180] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=5, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L181] var_1_23 = __VERIFIER_nondet_short() [L182] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L182] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L183] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L183] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_38=63/4, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L184] var_1_38 = __VERIFIER_nondet_double() [L185] CALL assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L185] RET assume_abort_if_not((var_1_38 >= 0.0F && var_1_38 <= -1.0e-20F) || (var_1_38 <= 2305843.009213691390e+12F && var_1_38 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-8, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L186] var_1_43 = __VERIFIER_nondet_char() [L187] CALL assume_abort_if_not(var_1_43 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L187] RET assume_abort_if_not(var_1_43 >= -126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L188] CALL assume_abort_if_not(var_1_43 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L188] RET assume_abort_if_not(var_1_43 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L204] RET updateVariables() [L205] CALL step() [L57] COND TRUE ! var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L58] COND FALSE !(\read(var_1_20)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=10, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L61] COND FALSE !(var_1_11 >= 25) [L72] var_1_26 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=-10, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L76] var_1_34 = ((((128) < (((((var_1_22) > ((-5 + var_1_10))) ? (var_1_22) : ((-5 + var_1_10)))))) ? (128) : (((((var_1_22) > ((-5 + var_1_10))) ? (var_1_22) : ((-5 + var_1_10))))))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=97/20, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L77] COND FALSE !(\read(var_1_20)) [L80] var_1_36 = ((((var_1_16) > (var_1_38)) ? (var_1_16) : (var_1_38))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-100, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L82] var_1_39 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L83] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=4, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L86] COND TRUE var_1_23 <= var_1_22 [L87] var_1_42 = ((((var_1_43) < 0 ) ? -(var_1_43) : (var_1_43))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=-25, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L89] COND TRUE (! var_1_20) || var_1_20 [L90] var_1_44 = var_1_23 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L102] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L103] COND TRUE var_1_11 <= last_1_var_1_25 [L104] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L107] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L108] COND FALSE !(var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) [L111] var_1_12 = var_1_16 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L113] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L114] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L121] COND FALSE !(\read(var_1_19)) [L124] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L126] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L127] COND TRUE var_1_19 || stepLocal_0 [L128] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L132] signed long int stepLocal_3 = var_1_22 + var_1_11; [L133] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-3, stepLocal_3=16381, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L134] COND FALSE !(\read(var_1_20)) [L147] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-3, stepLocal_3=16381, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8368, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L205] RET step() [L206] CALL, EXPR property() [L196-L197] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; VAL [\result=0, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8368, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L206] RET, EXPR property() [L206] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8368, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_16=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=8368, var_1_22=16385, var_1_23=8020, var_1_25=-4, var_1_26=-4, var_1_34=128, var_1_36=10000000005, var_1_38=10000000005, var_1_39=-4, var_1_41=-32, var_1_42=126, var_1_43=-126, var_1_44=8020, var_1_7=16383, var_1_8=32766, var_1_9=8368] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 468 mSDsluCounter, 1253 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 555 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 225 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 698 mSDtfsCounter, 225 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 499 GetRequests, 482 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 129 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1417 NumberOfCodeBlocks, 1417 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1407 ConstructedInterpolants, 0 QuantifiedInterpolants, 2155 SizeOfPredicates, 1 NumberOfNonLiveVariables, 758 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 9001/9108 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 21:34:59,458 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/21.0.5-tem/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.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.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 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 21:35:01,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 21:35:01,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-03 21:35:01,532 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 21:35:01,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 21:35:01,547 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 21:35:01,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 21:35:01,548 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 21:35:01,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 21:35:01,548 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 21:35:01,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 21:35:01,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 21:35:01,548 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 21:35:01,549 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 21:35:01,549 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 21:35:01,550 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:35:01,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 21:35:01,550 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 21:35:01,551 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 21:35:01,551 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 15bc9db627b3f25e2dd0c0f7f605c4f82a75892850cc409d90f3816f7fec9db6 [2025-03-03 21:35:01,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 21:35:01,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 21:35:01,796 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 21:35:01,798 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 21:35:01,799 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 21:35:01,800 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2025-03-03 21:35:02,985 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bac5dcac/80ea8881c8fb4b6780298dcb86720bc8/FLAGcfd80d6bc [2025-03-03 21:35:03,215 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 21:35:03,215 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2025-03-03 21:35:03,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bac5dcac/80ea8881c8fb4b6780298dcb86720bc8/FLAGcfd80d6bc [2025-03-03 21:35:03,242 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bac5dcac/80ea8881c8fb4b6780298dcb86720bc8 [2025-03-03 21:35:03,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 21:35:03,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 21:35:03,250 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 21:35:03,250 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 21:35:03,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 21:35:03,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,256 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2479805c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03, skipping insertion in model container [2025-03-03 21:35:03,256 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,276 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 21:35:03,394 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2025-03-03 21:35:03,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:35:03,480 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 21:35:03,488 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i[919,932] [2025-03-03 21:35:03,513 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 21:35:03,529 INFO L204 MainTranslator]: Completed translation [2025-03-03 21:35:03,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03 WrapperNode [2025-03-03 21:35:03,530 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 21:35:03,531 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 21:35:03,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 21:35:03,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 21:35:03,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,550 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,582 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 189 [2025-03-03 21:35:03,582 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 21:35:03,583 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 21:35:03,583 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 21:35:03,583 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 21:35:03,594 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,595 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,616 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]. [2025-03-03 21:35:03,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,635 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,638 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,649 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 21:35:03,650 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 21:35:03,651 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 21:35:03,651 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 21:35:03,652 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (1/1) ... [2025-03-03 21:35:03,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 21:35:03,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 21:35:03,684 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) [2025-03-03 21:35:03,688 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 [2025-03-03 21:35:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 21:35:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 21:35:03,709 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 21:35:03,710 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 21:35:03,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 21:35:03,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 21:35:03,783 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 21:35:03,785 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 21:35:09,685 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 21:35:09,685 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 21:35:09,692 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 21:35:09,692 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 21:35:09,693 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:35:09 BoogieIcfgContainer [2025-03-03 21:35:09,693 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 21:35:09,695 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 21:35:09,695 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 21:35:09,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 21:35:09,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:35:03" (1/3) ... [2025-03-03 21:35:09,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e43fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:35:09, skipping insertion in model container [2025-03-03 21:35:09,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:35:03" (2/3) ... [2025-03-03 21:35:09,699 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@285e43fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:35:09, skipping insertion in model container [2025-03-03 21:35:09,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:35:09" (3/3) ... [2025-03-03 21:35:09,699 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i [2025-03-03 21:35:09,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 21:35:09,709 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-15.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 21:35:09,740 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 21:35:09,747 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;@25ff4883, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 21:35:09,748 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 21:35:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:35:09,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:35:09,757 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:09,758 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:09,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:09,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1557124255, now seen corresponding path program 1 times [2025-03-03 21:35:09,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:09,769 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126377301] [2025-03-03 21:35:09,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:09,770 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 [2025-03-03 21:35:09,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:09,772 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) [2025-03-03 21:35:09,773 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 [2025-03-03 21:35:09,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:35:10,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:35:10,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:10,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:10,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 21:35:10,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:10,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 628 trivial. 0 not checked. [2025-03-03 21:35:10,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:10,304 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:10,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126377301] [2025-03-03 21:35:10,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126377301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:10,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:10,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:35:10,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986450525] [2025-03-03 21:35:10,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:10,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 21:35:10,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:10,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 21:35:10,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:35:10,322 INFO L87 Difference]: Start difference. First operand has 84 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 59 states have internal predecessors, (84), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:35:10,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:10,353 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2025-03-03 21:35:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 21:35:10,354 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 156 [2025-03-03 21:35:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:10,359 INFO L225 Difference]: With dead ends: 160 [2025-03-03 21:35:10,360 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 21:35:10,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 21:35:10,366 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:10,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 21:35:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 21:35:10,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2025-03-03 21:35:10,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:35:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 120 transitions. [2025-03-03 21:35:10,409 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 120 transitions. Word has length 156 [2025-03-03 21:35:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:10,409 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 120 transitions. [2025-03-03 21:35:10,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-03-03 21:35:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 120 transitions. [2025-03-03 21:35:10,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 21:35:10,414 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:10,414 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:10,433 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 [2025-03-03 21:35:10,615 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 [2025-03-03 21:35:10,615 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:10,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:10,616 INFO L85 PathProgramCache]: Analyzing trace with hash 733717316, now seen corresponding path program 1 times [2025-03-03 21:35:10,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:10,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146230181] [2025-03-03 21:35:10,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:10,618 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 [2025-03-03 21:35:10,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:10,620 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) [2025-03-03 21:35:10,622 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 [2025-03-03 21:35:10,681 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 21:35:11,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 21:35:11,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:11,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:11,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 21:35:11,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:11,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 21:35:11,420 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:11,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:35:11,858 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:11,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1146230181] [2025-03-03 21:35:11,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1146230181] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:35:11,858 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:35:11,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2025-03-03 21:35:11,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957367230] [2025-03-03 21:35:11,859 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:35:11,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 21:35:11,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:11,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 21:35:11,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-03 21:35:11,861 INFO L87 Difference]: Start difference. First operand 79 states and 120 transitions. Second operand has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:35:13,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:13,335 INFO L93 Difference]: Finished difference Result 160 states and 238 transitions. [2025-03-03 21:35:13,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 21:35:13,356 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 156 [2025-03-03 21:35:13,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:13,357 INFO L225 Difference]: With dead ends: 160 [2025-03-03 21:35:13,357 INFO L226 Difference]: Without dead ends: 84 [2025-03-03 21:35:13,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 304 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:35:13,359 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 69 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:13,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 190 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 21:35:13,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-03 21:35:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-03-03 21:35:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-03-03 21:35:13,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 113 transitions. [2025-03-03 21:35:13,368 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 113 transitions. Word has length 156 [2025-03-03 21:35:13,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:13,369 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 113 transitions. [2025-03-03 21:35:13,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.571428571428571) internal successors, (53), 7 states have internal predecessors, (53), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:35:13,369 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 113 transitions. [2025-03-03 21:35:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:35:13,370 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:13,370 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:13,388 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 [2025-03-03 21:35:13,571 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 [2025-03-03 21:35:13,571 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:13,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:13,572 INFO L85 PathProgramCache]: Analyzing trace with hash 295112738, now seen corresponding path program 1 times [2025-03-03 21:35:13,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:13,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1372118874] [2025-03-03 21:35:13,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:13,573 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 [2025-03-03 21:35:13,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:13,575 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) [2025-03-03 21:35:13,577 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 [2025-03-03 21:35:13,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:35:13,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:35:13,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:13,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:13,870 INFO L256 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 21:35:13,873 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:14,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:35:14,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:14,464 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:14,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1372118874] [2025-03-03 21:35:14,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1372118874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:14,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:14,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 21:35:14,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718753338] [2025-03-03 21:35:14,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:14,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 21:35:14,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:14,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 21:35:14,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:35:14,466 INFO L87 Difference]: Start difference. First operand 80 states and 113 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:35:16,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:16,135 INFO L93 Difference]: Finished difference Result 233 states and 331 transitions. [2025-03-03 21:35:16,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 21:35:16,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2025-03-03 21:35:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:16,137 INFO L225 Difference]: With dead ends: 233 [2025-03-03 21:35:16,137 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 21:35:16,138 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 21:35:16,138 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 24 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:16,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 190 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 21:35:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 21:35:16,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2025-03-03 21:35:16,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 103 states have (on average 1.2135922330097086) internal successors, (125), 103 states have internal predecessors, (125), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:35:16,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 217 transitions. [2025-03-03 21:35:16,168 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 217 transitions. Word has length 158 [2025-03-03 21:35:16,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:16,168 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 217 transitions. [2025-03-03 21:35:16,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 2 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:35:16,168 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 217 transitions. [2025-03-03 21:35:16,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-03 21:35:16,169 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:16,170 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:16,183 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 [2025-03-03 21:35:16,370 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 [2025-03-03 21:35:16,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:16,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:16,371 INFO L85 PathProgramCache]: Analyzing trace with hash -159032028, now seen corresponding path program 1 times [2025-03-03 21:35:16,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:16,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [102524002] [2025-03-03 21:35:16,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:16,372 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 [2025-03-03 21:35:16,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:16,374 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) [2025-03-03 21:35:16,376 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 [2025-03-03 21:35:16,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-03 21:35:16,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-03 21:35:16,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:16,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:16,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 21:35:16,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-03-03 21:35:18,206 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 21:35:18,206 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:18,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [102524002] [2025-03-03 21:35:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [102524002] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 21:35:18,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 21:35:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 21:35:18,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523842418] [2025-03-03 21:35:18,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 21:35:18,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 21:35:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:18,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 21:35:18,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 21:35:18,208 INFO L87 Difference]: Start difference. First operand 154 states and 217 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:35:19,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:20,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:20,785 INFO L93 Difference]: Finished difference Result 398 states and 560 transitions. [2025-03-03 21:35:20,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 21:35:20,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 158 [2025-03-03 21:35:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:20,805 INFO L225 Difference]: With dead ends: 398 [2025-03-03 21:35:20,805 INFO L226 Difference]: Without dead ends: 247 [2025-03-03 21:35:20,805 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 21:35:20,806 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 68 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:20,806 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 303 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 21:35:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2025-03-03 21:35:20,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2025-03-03 21:35:20,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 138 states have (on average 1.181159420289855) internal successors, (163), 138 states have internal predecessors, (163), 69 states have call successors, (69), 6 states have call predecessors, (69), 6 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 21:35:20,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 301 transitions. [2025-03-03 21:35:20,830 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 301 transitions. Word has length 158 [2025-03-03 21:35:20,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:20,830 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 301 transitions. [2025-03-03 21:35:20,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-03-03 21:35:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 301 transitions. [2025-03-03 21:35:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-03-03 21:35:20,832 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:20,832 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:20,842 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 (5)] Ended with exit code 0 [2025-03-03 21:35:21,032 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 [2025-03-03 21:35:21,032 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:21,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:21,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1658042720, now seen corresponding path program 1 times [2025-03-03 21:35:21,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:21,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157634273] [2025-03-03 21:35:21,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:21,033 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 [2025-03-03 21:35:21,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:21,035 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) [2025-03-03 21:35:21,036 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 [2025-03-03 21:35:21,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-03 21:35:21,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-03 21:35:21,313 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:21,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:21,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:35:21,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:22,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 504 refuted. 0 times theorem prover too weak. 469 trivial. 0 not checked. [2025-03-03 21:35:22,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:22,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 39 proven. 27 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:35:22,897 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:22,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157634273] [2025-03-03 21:35:22,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1157634273] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:35:22,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:35:22,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2025-03-03 21:35:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531821127] [2025-03-03 21:35:22,897 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:35:22,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 21:35:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:22,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 21:35:22,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-03-03 21:35:22,900 INFO L87 Difference]: Start difference. First operand 214 states and 301 transitions. Second operand has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 21:35:25,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:27,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:28,106 INFO L93 Difference]: Finished difference Result 556 states and 764 transitions. [2025-03-03 21:35:28,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 21:35:28,120 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) Word has length 159 [2025-03-03 21:35:28,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:28,123 INFO L225 Difference]: With dead ends: 556 [2025-03-03 21:35:28,123 INFO L226 Difference]: Without dead ends: 405 [2025-03-03 21:35:28,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2025-03-03 21:35:28,125 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 364 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:28,125 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 236 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-03 21:35:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-03 21:35:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 226. [2025-03-03 21:35:28,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 147 states have (on average 1.1564625850340136) internal successors, (170), 147 states have internal predecessors, (170), 69 states have call successors, (69), 9 states have call predecessors, (69), 9 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 21:35:28,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 308 transitions. [2025-03-03 21:35:28,170 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 308 transitions. Word has length 159 [2025-03-03 21:35:28,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:28,171 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 308 transitions. [2025-03-03 21:35:28,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 states have internal predecessors, (94), 4 states have call successors, (46), 3 states have call predecessors, (46), 5 states have return successors, (46), 4 states have call predecessors, (46), 4 states have call successors, (46) [2025-03-03 21:35:28,172 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 308 transitions. [2025-03-03 21:35:28,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:35:28,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:28,174 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:28,187 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 (6)] Ended with exit code 0 [2025-03-03 21:35:28,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /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 [2025-03-03 21:35:28,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:28,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:28,375 INFO L85 PathProgramCache]: Analyzing trace with hash -401871801, now seen corresponding path program 1 times [2025-03-03 21:35:28,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:28,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [648764499] [2025-03-03 21:35:28,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:28,376 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 [2025-03-03 21:35:28,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:28,377 INFO L229 MonitoredProcess]: Starting monitored process 7 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) [2025-03-03 21:35:28,378 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 (7)] Waiting until timeout for monitored process [2025-03-03 21:35:28,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:35:28,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:35:28,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:28,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:28,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:35:28,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 21:35:28,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:29,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:35:29,098 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:29,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [648764499] [2025-03-03 21:35:29,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [648764499] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:35:29,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:35:29,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-03 21:35:29,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174404971] [2025-03-03 21:35:29,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:35:29,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:35:29,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:29,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:35:29,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:35:29,100 INFO L87 Difference]: Start difference. First operand 226 states and 308 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:35:31,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:31,087 INFO L93 Difference]: Finished difference Result 320 states and 432 transitions. [2025-03-03 21:35:31,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:35:31,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 160 [2025-03-03 21:35:31,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:31,104 INFO L225 Difference]: With dead ends: 320 [2025-03-03 21:35:31,104 INFO L226 Difference]: Without dead ends: 161 [2025-03-03 21:35:31,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:35:31,105 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 140 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:31,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 189 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 21:35:31,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-03 21:35:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 148. [2025-03-03 21:35:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.1157894736842104) internal successors, (106), 95 states have internal predecessors, (106), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:35:31,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 198 transitions. [2025-03-03 21:35:31,118 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 198 transitions. Word has length 160 [2025-03-03 21:35:31,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:31,118 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 198 transitions. [2025-03-03 21:35:31,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:35:31,118 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 198 transitions. [2025-03-03 21:35:31,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:35:31,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:31,119 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:31,130 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 (7)] Ended with exit code 0 [2025-03-03 21:35:31,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 [2025-03-03 21:35:31,320 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:31,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:31,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1889127527, now seen corresponding path program 1 times [2025-03-03 21:35:31,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:31,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496673293] [2025-03-03 21:35:31,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:31,321 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 [2025-03-03 21:35:31,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:31,322 INFO L229 MonitoredProcess]: Starting monitored process 8 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) [2025-03-03 21:35:31,323 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 (8)] Waiting until timeout for monitored process [2025-03-03 21:35:31,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:35:31,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:35:31,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:31,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:31,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 21:35:31,598 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:35:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2025-03-03 21:35:31,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 21:35:32,071 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 45 proven. 21 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-03-03 21:35:32,072 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 21:35:32,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496673293] [2025-03-03 21:35:32,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496673293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 21:35:32,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 21:35:32,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2025-03-03 21:35:32,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206308879] [2025-03-03 21:35:32,072 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 21:35:32,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 21:35:32,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 21:35:32,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 21:35:32,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 21:35:32,073 INFO L87 Difference]: Start difference. First operand 148 states and 198 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:35:33,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-03-03 21:35:33,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 21:35:33,813 INFO L93 Difference]: Finished difference Result 237 states and 314 transitions. [2025-03-03 21:35:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 21:35:33,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 160 [2025-03-03 21:35:33,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 21:35:33,832 INFO L225 Difference]: With dead ends: 237 [2025-03-03 21:35:33,832 INFO L226 Difference]: Without dead ends: 156 [2025-03-03 21:35:33,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 311 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2025-03-03 21:35:33,833 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 133 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 21:35:33,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 189 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 21:35:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2025-03-03 21:35:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 148. [2025-03-03 21:35:33,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 95 states have (on average 1.105263157894737) internal successors, (105), 95 states have internal predecessors, (105), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-03-03 21:35:33,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 197 transitions. [2025-03-03 21:35:33,846 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 197 transitions. Word has length 160 [2025-03-03 21:35:33,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 21:35:33,847 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 197 transitions. [2025-03-03 21:35:33,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2025-03-03 21:35:33,847 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 197 transitions. [2025-03-03 21:35:33,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 21:35:33,848 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 21:35:33,848 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 21:35:33,859 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 (8)] Ended with exit code 0 [2025-03-03 21:35:34,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 [2025-03-03 21:35:34,049 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 21:35:34,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 21:35:34,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1518336088, now seen corresponding path program 1 times [2025-03-03 21:35:34,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 21:35:34,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661562650] [2025-03-03 21:35:34,050 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 21:35:34,050 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 [2025-03-03 21:35:34,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-03 21:35:34,053 INFO L229 MonitoredProcess]: Starting monitored process 9 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) [2025-03-03 21:35:34,053 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 (9)] Waiting until timeout for monitored process [2025-03-03 21:35:34,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 21:35:34,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 21:35:34,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 21:35:34,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 21:35:34,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-03-03 21:35:34,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 21:36:06,724 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)