./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:31:08,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:31:08,774 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 07:31:08,779 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:31:08,779 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:31:08,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:31:08,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:31:08,821 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:31:08,822 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:31:08,823 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:31:08,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:31:08,825 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:31:08,826 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:31:08,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:31:08,826 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:31:08,829 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:31:08,829 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:31:08,829 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:31:08,829 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 07:31:08,830 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:31:08,830 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:31:08,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:31:08,835 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:31:08,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:31:08,835 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:31:08,835 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:31:08,836 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:31:08,836 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:31:08,836 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:31:08,837 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:31:08,837 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:31:08,837 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:31:08,837 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:31:08,837 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:31:08,838 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:31:08,838 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:31:08,839 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 07:31:08,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 07:31:08,840 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:31:08,840 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:31:08,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:31:08,841 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:31:08,842 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad [2024-10-11 07:31:09,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:31:09,151 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:31:09,154 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:31:09,155 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:31:09,156 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:31:09,157 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2024-10-11 07:31:10,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:31:10,956 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:31:10,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2024-10-11 07:31:10,968 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ea3b9780/6f1d76b7bb9d4beab9d016ca79b89ede/FLAG79ea165c3 [2024-10-11 07:31:10,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/7ea3b9780/6f1d76b7bb9d4beab9d016ca79b89ede [2024-10-11 07:31:10,985 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:31:10,986 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:31:10,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:31:10,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:31:10,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:31:10,993 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:31:10" (1/1) ... [2024-10-11 07:31:10,994 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181ea4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:10, skipping insertion in model container [2024-10-11 07:31:10,994 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:31:10" (1/1) ... [2024-10-11 07:31:11,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:31:11,200 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2024-10-11 07:31:11,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:31:11,287 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:31:11,298 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2024-10-11 07:31:11,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:31:11,341 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:31:11,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11 WrapperNode [2024-10-11 07:31:11,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:31:11,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:31:11,344 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:31:11,344 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:31:11,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,367 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,423 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 158 [2024-10-11 07:31:11,424 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:31:11,424 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:31:11,425 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:31:11,425 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:31:11,437 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,438 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,447 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,473 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:31:11,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,484 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,488 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,491 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,497 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:31:11,498 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:31:11,498 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:31:11,498 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:31:11,499 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (1/1) ... [2024-10-11 07:31:11,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:31:11,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:31:11,546 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:31:11,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:31:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:31:11,600 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:31:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:31:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 07:31:11,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:31:11,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:31:11,695 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:31:11,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:31:12,071 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 07:31:12,071 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:31:12,136 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:31:12,136 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:31:12,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:31:12 BoogieIcfgContainer [2024-10-11 07:31:12,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:31:12,139 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:31:12,139 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:31:12,143 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:31:12,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:31:10" (1/3) ... [2024-10-11 07:31:12,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e73183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:31:12, skipping insertion in model container [2024-10-11 07:31:12,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:11" (2/3) ... [2024-10-11 07:31:12,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e73183 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:31:12, skipping insertion in model container [2024-10-11 07:31:12,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:31:12" (3/3) ... [2024-10-11 07:31:12,146 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-32.i [2024-10-11 07:31:12,166 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:31:12,167 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:31:12,225 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:31:12,232 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;@7798e11d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:31:12,232 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:31:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:31:12,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 07:31:12,253 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:12,254 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:12,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:12,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:12,263 INFO L85 PathProgramCache]: Analyzing trace with hash -596841797, now seen corresponding path program 1 times [2024-10-11 07:31:12,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:31:12,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271341745] [2024-10-11 07:31:12,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:31:12,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:31:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:31:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:31:12,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:31:12,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:31:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:31:12,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:31:12,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:31:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:31:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:31:12,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:31:12,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:31:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:31:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:31:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:31:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:31:12,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:31:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:31:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:31:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:31:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:31:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:31:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:31:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:31:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 07:31:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:31:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:12,816 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:31:12,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:31:12,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271341745] [2024-10-11 07:31:12,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271341745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:31:12,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:31:12,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:31:12,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729318576] [2024-10-11 07:31:12,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:31:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:31:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:31:12,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:31:12,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:31:12,847 INFO L87 Difference]: Start difference. First operand has 66 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:31:12,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:31:12,893 INFO L93 Difference]: Finished difference Result 129 states and 234 transitions. [2024-10-11 07:31:12,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:31:12,896 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 157 [2024-10-11 07:31:12,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:31:12,905 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:31:12,906 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:31:12,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:31:12,918 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:31:12,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 07:31:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:31:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:31:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:31:12,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-10-11 07:31:12,970 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 157 [2024-10-11 07:31:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:31:12,971 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-10-11 07:31:12,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.0) internal successors, (30), 2 states have internal predecessors, (30), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:31:12,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-10-11 07:31:12,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 07:31:12,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:12,976 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:12,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 07:31:12,977 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:12,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:12,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1827971069, now seen corresponding path program 1 times [2024-10-11 07:31:12,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:31:12,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924570073] [2024-10-11 07:31:12,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:12,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:31:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:31:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:31:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:31:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:31:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:31:13,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:31:13,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:31:13,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:31:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:31:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:31:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:31:13,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:31:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:31:13,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:31:13,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:31:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:31:13,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:31:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:31:13,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:31:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:31:13,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:31:13,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:31:13,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:31:13,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:31:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 07:31:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:31:13,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-11 07:31:13,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:31:13,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924570073] [2024-10-11 07:31:13,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924570073] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:31:13,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:31:13,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 07:31:13,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452785866] [2024-10-11 07:31:13,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:31:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 07:31:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:31:13,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 07:31:13,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:31:13,529 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:31:13,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:31:13,627 INFO L93 Difference]: Finished difference Result 154 states and 238 transitions. [2024-10-11 07:31:13,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 07:31:13,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 157 [2024-10-11 07:31:13,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:31:13,635 INFO L225 Difference]: With dead ends: 154 [2024-10-11 07:31:13,635 INFO L226 Difference]: Without dead ends: 91 [2024-10-11 07:31:13,636 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 07:31:13,637 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 40 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 07:31:13,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 200 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 07:31:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-11 07:31:13,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2024-10-11 07:31:13,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 54 states have internal predecessors, (72), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-10-11 07:31:13,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-10-11 07:31:13,664 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 157 [2024-10-11 07:31:13,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:31:13,665 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-10-11 07:31:13,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-11 07:31:13,665 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-10-11 07:31:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 07:31:13,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:13,668 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:13,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 07:31:13,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:13,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:13,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1147912699, now seen corresponding path program 1 times [2024-10-11 07:31:13,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:31:13,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522766867] [2024-10-11 07:31:13,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:13,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:31:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 07:31:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 07:31:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 07:31:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 07:31:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 07:31:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 07:31:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 07:31:13,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 07:31:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 07:31:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 07:31:13,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 07:31:13,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 07:31:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 07:31:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 07:31:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 07:31:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 07:31:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 07:31:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:13,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 07:31:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 07:31:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 07:31:14,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 07:31:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 07:31:14,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 07:31:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-10-11 07:31:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-10-11 07:31:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-11 07:31:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 07:31:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 07:31:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522766867] [2024-10-11 07:31:14,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522766867] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 07:31:14,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1983013526] [2024-10-11 07:31:14,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:14,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:31:14,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:31:14,079 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 07:31:14,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 07:31:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:14,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 07:31:14,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:31:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 403 proven. 12 refuted. 0 times theorem prover too weak. 885 trivial. 0 not checked. [2024-10-11 07:31:14,409 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:31:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 07:31:14,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1983013526] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:31:14,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 07:31:14,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-10-11 07:31:14,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426935650] [2024-10-11 07:31:14,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 07:31:14,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 07:31:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 07:31:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 07:31:14,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 07:31:14,654 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2024-10-11 07:31:15,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:31:15,053 INFO L93 Difference]: Finished difference Result 219 states and 335 transitions. [2024-10-11 07:31:15,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 07:31:15,055 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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 157 [2024-10-11 07:31:15,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:31:15,062 INFO L225 Difference]: With dead ends: 219 [2024-10-11 07:31:15,062 INFO L226 Difference]: Without dead ends: 132 [2024-10-11 07:31:15,063 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 361 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-11 07:31:15,064 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 91 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 07:31:15,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 208 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 07:31:15,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-10-11 07:31:15,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 125. [2024-10-11 07:31:15,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 68 states have (on average 1.25) internal successors, (85), 70 states have internal predecessors, (85), 53 states have call successors, (53), 3 states have call predecessors, (53), 3 states have return successors, (53), 51 states have call predecessors, (53), 53 states have call successors, (53) [2024-10-11 07:31:15,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2024-10-11 07:31:15,099 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 157 [2024-10-11 07:31:15,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:31:15,100 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2024-10-11 07:31:15,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 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) [2024-10-11 07:31:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2024-10-11 07:31:15,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 07:31:15,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:15,109 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:15,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 07:31:15,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 07:31:15,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:15,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1463744846, now seen corresponding path program 1 times [2024-10-11 07:31:15,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 07:31:15,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760291681] [2024-10-11 07:31:15,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 07:31:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:31:15,406 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 07:31:15,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 07:31:15,502 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 07:31:15,503 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 07:31:15,503 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 07:31:15,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 07:31:15,509 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-11 07:31:15,619 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 07:31:15,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 07:31:15 BoogieIcfgContainer [2024-10-11 07:31:15,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 07:31:15,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 07:31:15,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 07:31:15,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 07:31:15,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:31:12" (3/4) ... [2024-10-11 07:31:15,626 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 07:31:15,627 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 07:31:15,630 INFO L158 Benchmark]: Toolchain (without parser) took 4641.88ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 93.3MB in the beginning and 64.2MB in the end (delta: 29.1MB). Peak memory consumption was 79.1MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,630 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 148.9MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 07:31:15,631 INFO L158 Benchmark]: CACSL2BoogieTranslator took 355.53ms. Allocated memory is still 148.9MB. Free memory was 93.3MB in the beginning and 77.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,631 INFO L158 Benchmark]: Boogie Procedure Inliner took 80.38ms. Allocated memory is still 148.9MB. Free memory was 77.4MB in the beginning and 73.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,631 INFO L158 Benchmark]: Boogie Preprocessor took 72.58ms. Allocated memory is still 148.9MB. Free memory was 73.7MB in the beginning and 68.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,633 INFO L158 Benchmark]: RCFGBuilder took 639.10ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 68.5MB in the beginning and 151.3MB in the end (delta: -82.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,634 INFO L158 Benchmark]: TraceAbstraction took 3483.81ms. Allocated memory is still 197.1MB. Free memory was 150.3MB in the beginning and 65.3MB in the end (delta: 85.0MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,634 INFO L158 Benchmark]: Witness Printer took 4.14ms. Allocated memory is still 197.1MB. Free memory was 65.3MB in the beginning and 64.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 07:31:15,636 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 148.9MB. Free memory is still 108.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 355.53ms. Allocated memory is still 148.9MB. Free memory was 93.3MB in the beginning and 77.4MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 80.38ms. Allocated memory is still 148.9MB. Free memory was 77.4MB in the beginning and 73.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.58ms. Allocated memory is still 148.9MB. Free memory was 73.7MB in the beginning and 68.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 639.10ms. Allocated memory was 148.9MB in the beginning and 197.1MB in the end (delta: 48.2MB). Free memory was 68.5MB in the beginning and 151.3MB in the end (delta: -82.8MB). Peak memory consumption was 18.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3483.81ms. Allocated memory is still 197.1MB. Free memory was 150.3MB in the beginning and 65.3MB in the end (delta: 85.0MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * Witness Printer took 4.14ms. Allocated memory is still 197.1MB. Free memory was 65.3MB in the beginning and 64.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 139, overapproximation of someBinaryDOUBLEComparisonOperation at line 139. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 2; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = -25; [L25] unsigned char var_1_4 = 100; [L26] unsigned char var_1_5 = 2; [L27] unsigned char var_1_6 = 64; [L28] unsigned char var_1_7 = 32; [L29] unsigned char var_1_8 = 32; [L30] float var_1_9 = 100.5; [L31] unsigned char var_1_10 = 4; [L32] float var_1_11 = 0.8; [L33] float var_1_12 = 2.5; [L34] signed short int var_1_13 = -32; [L35] float var_1_14 = 3.2; [L36] unsigned char var_1_15 = 1; [L37] unsigned char var_1_16 = 0; [L38] unsigned char var_1_17 = 0; [L39] float var_1_18 = 0.25; [L40] float var_1_19 = 100000000.25; [L41] signed char var_1_20 = 0; [L42] signed char var_1_21 = 10; [L43] double var_1_22 = 1000000.5; [L44] unsigned long int var_1_23 = 256; [L45] unsigned long int var_1_24 = 50; [L143] isInitial = 1 [L144] FCALL initially() [L145] COND TRUE 1 [L146] FCALL updateLastVariables() [L147] CALL updateVariables() [L94] var_1_2 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L95] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L96] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=-25, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L97] var_1_3 = __VERIFIER_nondet_long() [L98] CALL assume_abort_if_not(var_1_3 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L98] RET assume_abort_if_not(var_1_3 >= -2147483648) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] CALL assume_abort_if_not(var_1_3 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L99] RET assume_abort_if_not(var_1_3 <= 2147483647) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=100, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L100] var_1_4 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_4 >= 95) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L101] RET assume_abort_if_not(var_1_4 >= 95) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L102] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=2, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L103] var_1_5 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L104] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L105] CALL assume_abort_if_not(var_1_5 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L105] RET assume_abort_if_not(var_1_5 <= 32) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L106] var_1_6 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_6 >= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L107] RET assume_abort_if_not(var_1_6 >= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L108] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L108] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=32, var_1_8=32, var_1_9=201/2] [L109] var_1_7 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L110] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_8=32, var_1_9=201/2] [L111] CALL assume_abort_if_not(var_1_7 <= 64) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L111] RET assume_abort_if_not(var_1_7 <= 64) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=32, var_1_9=201/2] [L112] var_1_8 = __VERIFIER_nondet_uchar() [L113] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_9=201/2] [L113] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_9=201/2] [L114] CALL assume_abort_if_not(var_1_8 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L114] RET assume_abort_if_not(var_1_8 <= 63) VAL [isInitial=1, var_1_10=4, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L115] var_1_10 = __VERIFIER_nondet_uchar() [L116] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L116] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L117] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_11=4/5, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L118] var_1_11 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L119] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=5/2, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L120] var_1_12 = __VERIFIER_nondet_float() [L121] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L121] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_14=16/5, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L122] var_1_14 = __VERIFIER_nondet_float() [L123] 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, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L123] 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, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L124] var_1_16 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L125] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L126] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L126] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=0, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L127] var_1_17 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L128] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L129] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L129] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_19=400000001/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L130] var_1_19 = __VERIFIER_nondet_float() [L131] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L131] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=10, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L132] var_1_21 = __VERIFIER_nondet_char() [L133] CALL assume_abort_if_not(var_1_21 >= -31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L133] RET assume_abort_if_not(var_1_21 >= -31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L134] CALL assume_abort_if_not(var_1_21 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L134] RET assume_abort_if_not(var_1_21 <= 31) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=2, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L147] RET updateVariables() [L148] CALL step() [L49] COND TRUE -32 < var_1_3 [L50] var_1_1 = (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))) VAL [isInitial=1, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=201/2] [L52] COND FALSE !((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) [L55] var_1_9 = var_1_12 VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L57] COND FALSE !((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=1, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L66] COND FALSE !(var_1_5 >= var_1_6) [L75] var_1_15 = var_1_17 VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L77] unsigned char stepLocal_1 = var_1_15; [L78] unsigned char stepLocal_0 = var_1_15; VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=-255, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L79] COND TRUE var_1_17 || stepLocal_1 VAL [isInitial=1, stepLocal_0=-255, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=1/4, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L80] COND FALSE !(stepLocal_0 && var_1_2) [L83] var_1_18 = var_1_19 VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=100000006, var_1_19=100000006, var_1_1=32, var_1_20=0, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L86] COND TRUE var_1_11 == var_1_18 [L87] var_1_20 = ((var_1_5 + var_1_21) + var_1_8) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=100000006, var_1_19=100000006, var_1_1=32, var_1_20=94, var_1_21=31, var_1_22=2000001/2, var_1_23=256, var_1_24=50, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L89] var_1_22 = var_1_12 [L90] var_1_23 = var_1_8 [L91] var_1_24 = var_1_6 [L148] RET step() [L149] CALL, EXPR property() [L139-L140] return (((((((((-32 < var_1_3) ? (var_1_1 == ((unsigned char) (((var_1_4 - var_1_5) + var_1_6) - (var_1_7 + ((((var_1_8) < 0 ) ? -(var_1_8) : (var_1_8))))))) : 1) && (((var_1_10 + ((((var_1_3) > (var_1_6)) ? (var_1_3) : (var_1_6)))) == var_1_5) ? (var_1_9 == ((float) ((4.5f + var_1_11) - var_1_12))) : (var_1_9 == ((float) var_1_12)))) && (((var_1_12 * ((((var_1_9) < (var_1_11)) ? (var_1_9) : (var_1_11)))) > (- var_1_14)) ? ((var_1_6 <= var_1_8) ? (var_1_2 ? (var_1_13 == ((signed short int) var_1_8)) : (var_1_13 == ((signed short int) var_1_5))) : 1) : 1)) && ((var_1_5 >= var_1_6) ? ((var_1_13 <= var_1_10) ? (var_1_15 == ((unsigned char) var_1_16)) : ((var_1_2 || var_1_16) ? (var_1_15 == ((unsigned char) var_1_17)) : 1)) : (var_1_15 == ((unsigned char) var_1_17)))) && ((var_1_17 || var_1_15) ? ((var_1_15 && var_1_2) ? (var_1_18 == ((float) (var_1_11 + var_1_19))) : (var_1_18 == ((float) var_1_19))) : 1)) && ((var_1_11 == var_1_18) ? (var_1_20 == ((signed char) ((var_1_5 + var_1_21) + var_1_8))) : 1)) && (var_1_22 == ((double) var_1_12))) && (var_1_23 == ((unsigned long int) var_1_8))) && (var_1_24 == ((unsigned long int) var_1_6)) ; [L149] RET, EXPR property() [L149] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=100000006, var_1_19=100000006, var_1_1=32, var_1_20=94, var_1_21=31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_12=100000005, var_1_13=-32, var_1_15=-255, var_1_16=0, var_1_17=-255, var_1_18=100000006, var_1_19=100000006, var_1_1=32, var_1_20=94, var_1_21=31, var_1_22=100000005, var_1_23=63, var_1_24=64, var_1_2=0, var_1_3=65, var_1_4=-32417, var_1_5=0, var_1_6=64, var_1_7=64, var_1_8=63, var_1_9=100000005] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 131 mSDsluCounter, 505 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 187 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 285 IncrementalHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 318 mSDtfsCounter, 285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 495 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=125occurred in iteration=3, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 780 ConstructedInterpolants, 0 QuantifiedInterpolants, 1302 SizeOfPredicates, 2 NumberOfNonLiveVariables, 357 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 6464/6500 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 07:31:15,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 07:31:17,867 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 07:31:17,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 07:31:17,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 07:31:17,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 07:31:17,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 07:31:17,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 07:31:17,978 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 07:31:17,979 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 07:31:17,979 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 07:31:17,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 07:31:17,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 07:31:17,981 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 07:31:17,982 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 07:31:17,982 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 07:31:17,983 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 07:31:17,983 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 07:31:17,983 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 07:31:17,984 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 07:31:17,984 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 07:31:17,984 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 07:31:17,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 07:31:17,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 07:31:17,989 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 07:31:17,989 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 07:31:17,989 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 07:31:17,989 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 07:31:17,990 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 07:31:17,990 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 07:31:17,990 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 07:31:17,990 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 07:31:17,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 07:31:17,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 07:31:17,992 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 07:31:17,992 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:31:17,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 07:31:17,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 07:31:17,993 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 07:31:17,993 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 07:31:17,993 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 07:31:17,993 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 07:31:17,994 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 07:31:17,994 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 07:31:17,994 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 07:31:17,995 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 07:31:17,995 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 905ea402cc55bdef24afb6746a861e91183650285de09f36be5802e4884371ad [2024-10-11 07:31:18,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 07:31:18,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 07:31:18,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 07:31:18,360 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 07:31:18,360 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 07:31:18,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2024-10-11 07:31:19,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 07:31:20,080 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 07:31:20,080 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i [2024-10-11 07:31:20,093 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4c48513f6/50ac20500ed24cafa259ba2f317949e6/FLAG36bc4b0e7 [2024-10-11 07:31:20,109 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/4c48513f6/50ac20500ed24cafa259ba2f317949e6 [2024-10-11 07:31:20,111 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 07:31:20,113 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 07:31:20,117 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 07:31:20,117 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 07:31:20,122 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 07:31:20,123 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,124 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@949710b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20, skipping insertion in model container [2024-10-11 07:31:20,124 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,158 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 07:31:20,360 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2024-10-11 07:31:20,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:31:20,467 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 07:31:20,479 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-32.i[917,930] [2024-10-11 07:31:20,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 07:31:20,544 INFO L204 MainTranslator]: Completed translation [2024-10-11 07:31:20,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20 WrapperNode [2024-10-11 07:31:20,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 07:31:20,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 07:31:20,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 07:31:20,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 07:31:20,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,609 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 156 [2024-10-11 07:31:20,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 07:31:20,613 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 07:31:20,613 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 07:31:20,613 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 07:31:20,623 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,628 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,651 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 07:31:20,651 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,651 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,664 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,672 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,678 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,679 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 07:31:20,683 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 07:31:20,683 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 07:31:20,683 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 07:31:20,684 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (1/1) ... [2024-10-11 07:31:20,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 07:31:20,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 07:31:20,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 07:31:20,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 07:31:20,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 07:31:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 07:31:20,775 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 07:31:20,775 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 07:31:20,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 07:31:20,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 07:31:20,869 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 07:31:20,872 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 07:31:23,413 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-11 07:31:23,413 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 07:31:23,484 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 07:31:23,484 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 07:31:23,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:31:23 BoogieIcfgContainer [2024-10-11 07:31:23,485 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 07:31:23,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 07:31:23,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 07:31:23,493 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 07:31:23,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 07:31:20" (1/3) ... [2024-10-11 07:31:23,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db3e8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:31:23, skipping insertion in model container [2024-10-11 07:31:23,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 07:31:20" (2/3) ... [2024-10-11 07:31:23,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db3e8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 07:31:23, skipping insertion in model container [2024-10-11 07:31:23,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 07:31:23" (3/3) ... [2024-10-11 07:31:23,497 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-32.i [2024-10-11 07:31:23,513 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 07:31:23,513 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 07:31:23,572 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 07:31:23,578 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;@7360ef1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 07:31:23,579 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 07:31:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:31:23,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 07:31:23,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:23,594 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:23,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:23,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:23,599 INFO L85 PathProgramCache]: Analyzing trace with hash -596841797, now seen corresponding path program 1 times [2024-10-11 07:31:23,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:31:23,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384290724] [2024-10-11 07:31:23,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:23,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:31:23,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:31:23,618 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:31:23,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 07:31:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:23,953 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 07:31:23,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:31:24,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 674 proven. 0 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2024-10-11 07:31:24,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 07:31:24,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:31:24,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384290724] [2024-10-11 07:31:24,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384290724] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 07:31:24,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 07:31:24,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 07:31:24,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470952434] [2024-10-11 07:31:24,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 07:31:24,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 07:31:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:31:24,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 07:31:24,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:31:24,101 INFO L87 Difference]: Start difference. First operand has 66 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:31:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:31:25,124 INFO L93 Difference]: Finished difference Result 129 states and 234 transitions. [2024-10-11 07:31:25,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 07:31:25,143 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 157 [2024-10-11 07:31:25,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:31:25,149 INFO L225 Difference]: With dead ends: 129 [2024-10-11 07:31:25,149 INFO L226 Difference]: Without dead ends: 64 [2024-10-11 07:31:25,152 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 07:31:25,156 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 07:31:25,157 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 07:31:25,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-11 07:31:25,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-11 07:31:25,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 36 states have internal predecessors, (48), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 07:31:25,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 100 transitions. [2024-10-11 07:31:25,201 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 100 transitions. Word has length 157 [2024-10-11 07:31:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:31:25,202 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 100 transitions. [2024-10-11 07:31:25,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.0) internal successors, (34), 2 states have internal predecessors, (34), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-11 07:31:25,204 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 100 transitions. [2024-10-11 07:31:25,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-10-11 07:31:25,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:25,207 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:25,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 07:31:25,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:31:25,408 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:25,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:25,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1827971069, now seen corresponding path program 1 times [2024-10-11 07:31:25,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:31:25,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176490376] [2024-10-11 07:31:25,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:31:25,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:31:25,415 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:31:25,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 07:31:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:25,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 07:31:25,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:31:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 409 proven. 18 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2024-10-11 07:31:26,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 07:31:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 63 proven. 12 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2024-10-11 07:31:26,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 07:31:26,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176490376] [2024-10-11 07:31:26,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176490376] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 07:31:26,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 07:31:26,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 14 [2024-10-11 07:31:26,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805946813] [2024-10-11 07:31:26,867 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 07:31:26,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 07:31:26,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 07:31:26,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 07:31:26,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-10-11 07:31:26,873 INFO L87 Difference]: Start difference. First operand 64 states and 100 transitions. Second operand has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 07:31:29,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:31:31,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 07:31:32,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 07:31:32,265 INFO L93 Difference]: Finished difference Result 246 states and 371 transitions. [2024-10-11 07:31:32,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-11 07:31:32,266 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 157 [2024-10-11 07:31:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 07:31:32,269 INFO L225 Difference]: With dead ends: 246 [2024-10-11 07:31:32,270 INFO L226 Difference]: Without dead ends: 183 [2024-10-11 07:31:32,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2024-10-11 07:31:32,272 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 214 mSDsluCounter, 601 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-10-11 07:31:32,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 734 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-10-11 07:31:32,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-10-11 07:31:32,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2024-10-11 07:31:32,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 94 states have (on average 1.2340425531914894) internal successors, (116), 95 states have internal predecessors, (116), 73 states have call successors, (73), 6 states have call predecessors, (73), 6 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2024-10-11 07:31:32,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 262 transitions. [2024-10-11 07:31:32,328 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 262 transitions. Word has length 157 [2024-10-11 07:31:32,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 07:31:32,329 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 262 transitions. [2024-10-11 07:31:32,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.642857142857143) internal successors, (51), 14 states have internal predecessors, (51), 3 states have call successors, (30), 3 states have call predecessors, (30), 5 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2024-10-11 07:31:32,329 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 262 transitions. [2024-10-11 07:31:32,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-10-11 07:31:32,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 07:31:32,332 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 07:31:32,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-11 07:31:32,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:31:32,536 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 07:31:32,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 07:31:32,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1070717836, now seen corresponding path program 1 times [2024-10-11 07:31:32,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 07:31:32,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1210056988] [2024-10-11 07:31:32,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 07:31:32,538 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 07:31:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 07:31:32,541 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 07:31:32,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 07:31:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 07:31:32,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 07:31:32,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 07:31:43,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 1052 proven. 195 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2024-10-11 07:31:43,875 INFO L311 TraceCheckSpWp]: Computing backward predicates...