./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:32:39,487 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:32:39,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 03:32:39,565 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:32:39,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:32:39,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:32:39,596 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:32:39,597 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:32:39,597 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:32:39,599 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:32:39,599 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:32:39,600 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:32:39,600 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:32:39,602 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:32:39,602 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:32:39,602 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:32:39,602 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:32:39,603 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:32:39,603 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 03:32:39,603 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:32:39,605 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:32:39,607 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:32:39,607 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:32:39,607 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:32:39,608 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:32:39,608 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:32:39,608 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:32:39,608 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:32:39,609 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:32:39,609 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:32:39,609 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:32:39,609 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:32:39,609 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:32:39,610 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:32:39,610 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:32:39,611 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:32:39,611 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 03:32:39,611 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 03:32:39,612 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:32:39,612 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:32:39,612 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:32:39,612 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:32:39,613 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 [2024-11-10 03:32:39,922 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:32:39,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:32:39,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:32:39,953 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:32:39,953 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:32:39,954 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-11-10 03:32:41,336 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:32:41,569 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:32:41,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-11-10 03:32:41,583 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08efb02b/e6f973b74bf54d888073f7e86de7de2f/FLAG375373a8b [2024-11-10 03:32:41,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b08efb02b/e6f973b74bf54d888073f7e86de7de2f [2024-11-10 03:32:41,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:32:41,920 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:32:41,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:32:41,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:32:41,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:32:41,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:41" (1/1) ... [2024-11-10 03:32:41,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2eafc4d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:41, skipping insertion in model container [2024-11-10 03:32:41,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:32:41" (1/1) ... [2024-11-10 03:32:41,954 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:32:42,112 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i[917,930] [2024-11-10 03:32:42,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:32:42,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:32:42,227 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i[917,930] [2024-11-10 03:32:42,270 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:32:42,292 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:32:42,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42 WrapperNode [2024-11-10 03:32:42,293 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:32:42,294 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:32:42,294 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:32:42,294 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:32:42,301 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,312 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,349 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 153 [2024-11-10 03:32:42,349 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:32:42,350 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:32:42,350 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:32:42,350 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:32:42,363 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,364 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,399 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-11-10 03:32:42,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,416 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,426 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,432 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,436 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:32:42,437 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:32:42,438 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:32:42,438 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:32:42,439 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (1/1) ... [2024-11-10 03:32:42,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:32:42,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:42,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:32:42,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:32:42,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:32:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:32:42,562 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:32:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 03:32:42,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:32:42,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:32:42,667 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:32:42,669 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:32:43,051 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:32:43,055 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:32:43,075 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:32:43,076 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:32:43,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:43 BoogieIcfgContainer [2024-11-10 03:32:43,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:32:43,080 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:32:43,080 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:32:43,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:32:43,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:32:41" (1/3) ... [2024-11-10 03:32:43,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55121bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:43, skipping insertion in model container [2024-11-10 03:32:43,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:32:42" (2/3) ... [2024-11-10 03:32:43,086 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55121bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:32:43, skipping insertion in model container [2024-11-10 03:32:43,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:43" (3/3) ... [2024-11-10 03:32:43,088 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-41.i [2024-11-10 03:32:43,104 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:32:43,105 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:32:43,177 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:32:43,182 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;@4c8a3ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:32:43,183 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:32:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:32:43,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:32:43,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:43,199 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:32:43,199 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:43,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:43,204 INFO L85 PathProgramCache]: Analyzing trace with hash -815582234, now seen corresponding path program 1 times [2024-11-10 03:32:43,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:43,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92966677] [2024-11-10 03:32:43,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:43,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:43,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:32:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:43,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:32:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:32:43,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:43,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:32:43,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:32:43,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:32:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:32:43,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:32:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:32:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:43,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:43,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:43,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:32:43,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:32:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:32:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:32:43,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:32:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:32:43,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:32:43,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:43,682 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 03:32:43,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:43,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92966677] [2024-11-10 03:32:43,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92966677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:43,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:43,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:32:43,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117569984] [2024-11-10 03:32:43,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:43,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:32:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:43,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:32:43,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:32:43,721 INFO L87 Difference]: Start difference. First operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:32:43,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:43,753 INFO L93 Difference]: Finished difference Result 144 states and 244 transitions. [2024-11-10 03:32:43,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:32:43,757 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2024-11-10 03:32:43,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:43,767 INFO L225 Difference]: With dead ends: 144 [2024-11-10 03:32:43,767 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 03:32:43,770 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-11-10 03:32:43,774 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:43,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:32:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 03:32:43,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 03:32:43,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:32:43,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2024-11-10 03:32:43,824 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 162 [2024-11-10 03:32:43,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:43,827 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2024-11-10 03:32:43,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:32:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-11-10 03:32:43,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:32:43,833 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:43,833 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:32:43,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 03:32:43,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:43,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1134080359, now seen corresponding path program 1 times [2024-11-10 03:32:43,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:43,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598711187] [2024-11-10 03:32:43,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:43,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:32:44,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557577718] [2024-11-10 03:32:44,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:44,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:44,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:44,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:32:44,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 03:32:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:44,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 03:32:44,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:45,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-10 03:32:45,579 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:32:51,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:51,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598711187] [2024-11-10 03:32:51,519 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:32:51,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557577718] [2024-11-10 03:32:51,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557577718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:32:51,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 03:32:51,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2024-11-10 03:32:51,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560995329] [2024-11-10 03:32:51,520 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 03:32:51,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 03:32:51,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:51,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 03:32:51,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=343, Unknown=2, NotChecked=0, Total=462 [2024-11-10 03:32:51,523 INFO L87 Difference]: Start difference. First operand 71 states and 105 transitions. Second operand has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-10 03:32:52,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:52,947 INFO L93 Difference]: Finished difference Result 266 states and 368 transitions. [2024-11-10 03:32:52,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2024-11-10 03:32:52,948 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 162 [2024-11-10 03:32:52,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:52,952 INFO L225 Difference]: With dead ends: 266 [2024-11-10 03:32:52,952 INFO L226 Difference]: Without dead ends: 198 [2024-11-10 03:32:52,954 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=392, Invalid=1088, Unknown=2, NotChecked=0, Total=1482 [2024-11-10 03:32:52,955 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 165 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:52,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 573 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 03:32:52,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-10 03:32:52,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 132. [2024-11-10 03:32:52,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 83 states have (on average 1.180722891566265) internal successors, (98), 84 states have internal predecessors, (98), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 41 states have call predecessors, (42), 42 states have call successors, (42) [2024-11-10 03:32:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 182 transitions. [2024-11-10 03:32:52,999 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 182 transitions. Word has length 162 [2024-11-10 03:32:53,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:53,000 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 182 transitions. [2024-11-10 03:32:53,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.411764705882353) internal successors, (58), 16 states have internal predecessors, (58), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-10 03:32:53,000 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 182 transitions. [2024-11-10 03:32:53,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:32:53,005 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:53,005 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:32:53,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 03:32:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:53,207 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:53,208 INFO L85 PathProgramCache]: Analyzing trace with hash -673374104, now seen corresponding path program 1 times [2024-11-10 03:32:53,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756921499] [2024-11-10 03:32:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 03:32:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 03:32:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 03:32:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 03:32:53,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 03:32:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 03:32:53,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 03:32:53,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 03:32:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 03:32:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 03:32:53,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 03:32:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 03:32:53,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 03:32:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 03:32:53,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 03:32:53,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 03:32:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 03:32:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 03:32:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 03:32:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 03:32:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 03:32:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 03:32:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 03:32:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 03:32:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 03:32:53,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:53,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-10 03:32:53,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:53,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756921499] [2024-11-10 03:32:53,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756921499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:32:53,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:32:53,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 03:32:53,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973200023] [2024-11-10 03:32:53,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:32:53,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 03:32:53,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:53,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 03:32:53,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 03:32:53,442 INFO L87 Difference]: Start difference. First operand 132 states and 182 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 03:32:53,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:53,503 INFO L93 Difference]: Finished difference Result 275 states and 372 transitions. [2024-11-10 03:32:53,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 03:32:53,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 162 [2024-11-10 03:32:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:53,512 INFO L225 Difference]: With dead ends: 275 [2024-11-10 03:32:53,512 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 03:32:53,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 52 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-11-10 03:32:53,519 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 23 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:53,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 205 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:32:53,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 03:32:53,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 142. [2024-11-10 03:32:53,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 92 states have internal predecessors, (103), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 41 states have call predecessors, (43), 43 states have call successors, (43) [2024-11-10 03:32:53,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 189 transitions. [2024-11-10 03:32:53,546 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 189 transitions. Word has length 162 [2024-11-10 03:32:53,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:53,547 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 189 transitions. [2024-11-10 03:32:53,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-10 03:32:53,547 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 189 transitions. [2024-11-10 03:32:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:32:53,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:53,550 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:32:53,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 03:32:53,550 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:53,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:53,551 INFO L85 PathProgramCache]: Analyzing trace with hash -662871000, now seen corresponding path program 1 times [2024-11-10 03:32:53,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:53,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870854759] [2024-11-10 03:32:53,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:32:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569093997] [2024-11-10 03:32:53,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:53,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:53,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:53,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:32:53,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 03:32:54,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:54,013 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 03:32:54,019 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 532 proven. 33 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-10 03:32:54,772 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:32:57,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:32:57,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870854759] [2024-11-10 03:32:57,658 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:32:57,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569093997] [2024-11-10 03:32:57,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569093997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:32:57,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 03:32:57,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2024-11-10 03:32:57,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195465848] [2024-11-10 03:32:57,661 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 03:32:57,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-10 03:32:57,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:32:57,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-10 03:32:57,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2024-11-10 03:32:57,663 INFO L87 Difference]: Start difference. First operand 142 states and 189 transitions. Second operand has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-10 03:32:58,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:32:58,715 INFO L93 Difference]: Finished difference Result 337 states and 450 transitions. [2024-11-10 03:32:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-10 03:32:58,716 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) Word has length 162 [2024-11-10 03:32:58,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:32:58,719 INFO L225 Difference]: With dead ends: 337 [2024-11-10 03:32:58,721 INFO L226 Difference]: Without dead ends: 206 [2024-11-10 03:32:58,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=252, Invalid=740, Unknown=0, NotChecked=0, Total=992 [2024-11-10 03:32:58,724 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 181 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 03:32:58,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 509 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 03:32:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2024-11-10 03:32:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 183. [2024-11-10 03:32:58,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 113 states have (on average 1.1327433628318584) internal successors, (128), 116 states have internal predecessors, (128), 60 states have call successors, (60), 9 states have call predecessors, (60), 9 states have return successors, (60), 57 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-10 03:32:58,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 248 transitions. [2024-11-10 03:32:58,785 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 248 transitions. Word has length 162 [2024-11-10 03:32:58,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:32:58,785 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 248 transitions. [2024-11-10 03:32:58,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.625) internal successors, (58), 15 states have internal predecessors, (58), 5 states have call successors, (25), 5 states have call predecessors, (25), 7 states have return successors, (25), 5 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-10 03:32:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 248 transitions. [2024-11-10 03:32:58,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:32:58,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:32:58,788 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:32:58,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 03:32:58,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-10 03:32:58,990 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:32:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:32:58,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1824641833, now seen corresponding path program 1 times [2024-11-10 03:32:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:32:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122211283] [2024-11-10 03:32:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:32:59,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:32:59,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [921580105] [2024-11-10 03:32:59,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:32:59,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:32:59,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:32:59,104 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:32:59,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 03:32:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:32:59,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-10 03:32:59,367 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:32:59,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 510 proven. 36 refuted. 0 times theorem prover too weak. 654 trivial. 0 not checked. [2024-11-10 03:32:59,874 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 03:33:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 03:33:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122211283] [2024-11-10 03:33:00,367 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-10 03:33:00,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921580105] [2024-11-10 03:33:00,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [921580105] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 03:33:00,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-10 03:33:00,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2024-11-10 03:33:00,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815484987] [2024-11-10 03:33:00,368 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-10 03:33:00,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-10 03:33:00,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 03:33:00,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-10 03:33:00,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2024-11-10 03:33:00,370 INFO L87 Difference]: Start difference. First operand 183 states and 248 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-10 03:33:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:01,290 INFO L93 Difference]: Finished difference Result 409 states and 554 transitions. [2024-11-10 03:33:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 03:33:01,291 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 162 [2024-11-10 03:33:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:01,295 INFO L225 Difference]: With dead ends: 409 [2024-11-10 03:33:01,295 INFO L226 Difference]: Without dead ends: 237 [2024-11-10 03:33:01,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=565, Unknown=0, NotChecked=0, Total=756 [2024-11-10 03:33:01,298 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 90 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 03:33:01,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 616 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 03:33:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2024-11-10 03:33:01,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 171. [2024-11-10 03:33:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 102 states have (on average 1.1176470588235294) internal successors, (114), 104 states have internal predecessors, (114), 59 states have call successors, (59), 9 states have call predecessors, (59), 9 states have return successors, (59), 57 states have call predecessors, (59), 59 states have call successors, (59) [2024-11-10 03:33:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 232 transitions. [2024-11-10 03:33:01,341 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 232 transitions. Word has length 162 [2024-11-10 03:33:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:01,341 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 232 transitions. [2024-11-10 03:33:01,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 4 states have call successors, (25), 4 states have call predecessors, (25), 5 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-10 03:33:01,342 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 232 transitions. [2024-11-10 03:33:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-10 03:33:01,344 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:01,344 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:33:01,364 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 03:33:01,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:01,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:01,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:01,549 INFO L85 PathProgramCache]: Analyzing trace with hash -759206690, now seen corresponding path program 1 times [2024-11-10 03:33:01,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 03:33:01,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332731074] [2024-11-10 03:33:01,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:01,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 03:33:01,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 03:33:01,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1517361487] [2024-11-10 03:33:01,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:01,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:01,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:33:01,684 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 03:33:01,690 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 03:33:01,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:33:01,889 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 03:33:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 03:33:02,036 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 03:33:02,036 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 03:33:02,037 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 03:33:02,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-10 03:33:02,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 03:33:02,245 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 03:33:02,367 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 03:33:02,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 03:33:02 BoogieIcfgContainer [2024-11-10 03:33:02,372 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 03:33:02,372 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 03:33:02,372 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 03:33:02,373 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 03:33:02,373 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:32:43" (3/4) ... [2024-11-10 03:33:02,376 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 03:33:02,377 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 03:33:02,378 INFO L158 Benchmark]: Toolchain (without parser) took 20457.76ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 104.1MB in the beginning and 133.9MB in the end (delta: -29.8MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2024-11-10 03:33:02,378 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:33:02,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 371.10ms. Allocated memory is still 148.9MB. Free memory was 103.6MB in the beginning and 87.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 03:33:02,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.40ms. Allocated memory is still 148.9MB. Free memory was 87.8MB in the beginning and 84.2MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 03:33:02,379 INFO L158 Benchmark]: Boogie Preprocessor took 86.11ms. Allocated memory is still 148.9MB. Free memory was 84.2MB in the beginning and 78.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 03:33:02,379 INFO L158 Benchmark]: IcfgBuilder took 639.96ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 100.2MB in the end (delta: -21.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 03:33:02,379 INFO L158 Benchmark]: TraceAbstraction took 19291.69ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 99.5MB in the beginning and 133.9MB in the end (delta: -34.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2024-11-10 03:33:02,380 INFO L158 Benchmark]: Witness Printer took 5.27ms. Allocated memory is still 205.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 03:33:02,381 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 67.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 371.10ms. Allocated memory is still 148.9MB. Free memory was 103.6MB in the beginning and 87.8MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.40ms. Allocated memory is still 148.9MB. Free memory was 87.8MB in the beginning and 84.2MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.11ms. Allocated memory is still 148.9MB. Free memory was 84.2MB in the beginning and 78.9MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 639.96ms. Allocated memory is still 148.9MB. Free memory was 78.9MB in the beginning and 100.2MB in the end (delta: -21.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19291.69ms. Allocated memory was 148.9MB in the beginning and 205.5MB in the end (delta: 56.6MB). Free memory was 99.5MB in the beginning and 133.9MB in the end (delta: -34.3MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. * Witness Printer took 5.27ms. Allocated memory is still 205.5MB. Free memory is still 133.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 136, overapproximation of someBinaryDOUBLEComparisonOperation at line 136. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] float var_1_2 = 100.25; [L24] unsigned char var_1_3 = 1; [L25] unsigned char var_1_4 = 1; [L26] unsigned char var_1_5 = 1; [L27] unsigned char var_1_6 = 0; [L28] double var_1_7 = 4.8; [L29] signed char var_1_8 = 64; [L30] unsigned short int var_1_9 = 4; [L31] unsigned short int var_1_10 = 0; [L32] signed char var_1_11 = -10; [L33] signed char var_1_12 = 64; [L34] float var_1_13 = 1.6; [L35] float var_1_14 = 3.5; [L36] unsigned char var_1_15 = 8; [L37] unsigned char var_1_16 = 4; [L38] unsigned short int var_1_17 = 2; [L39] unsigned short int var_1_18 = 10000; [L40] unsigned short int var_1_19 = 5; [L41] signed short int var_1_20 = 4; [L42] unsigned long int var_1_21 = 5; [L43] signed char var_1_22 = -32; [L44] unsigned long int var_1_23 = 0; VAL [isInitial=0, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_2=401/4, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L140] isInitial = 1 [L141] FCALL initially() [L142] COND TRUE 1 [L143] FCALL updateLastVariables() [L144] CALL updateVariables() [L93] var_1_2 = __VERIFIER_nondet_float() [L94] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L94] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L95] var_1_3 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L96] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] CALL assume_abort_if_not(var_1_3 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L97] RET assume_abort_if_not(var_1_3 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L98] var_1_4 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_4 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L99] RET assume_abort_if_not(var_1_4 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L100] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L101] var_1_5 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_5 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L102] RET assume_abort_if_not(var_1_5 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L103] CALL assume_abort_if_not(var_1_5 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L103] RET assume_abort_if_not(var_1_5 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_7=24/5, var_1_8=64, var_1_9=4] [L104] var_1_7 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L105] RET assume_abort_if_not((var_1_7 >= -922337.2036854776000e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854776000e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64, var_1_9=4] [L106] var_1_9 = __VERIFIER_nondet_ushort() [L107] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L107] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] CALL assume_abort_if_not(var_1_9 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L108] RET assume_abort_if_not(var_1_9 <= 65535) VAL [isInitial=1, var_1_10=0, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L109] var_1_10 = __VERIFIER_nondet_ushort() [L110] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L110] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] CALL assume_abort_if_not(var_1_10 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L111] RET assume_abort_if_not(var_1_10 <= 65535) VAL [isInitial=1, var_1_11=-10, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L112] var_1_11 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L113] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L114] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=64, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L115] var_1_12 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L116] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L117] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_14=7/2, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L118] var_1_14 = __VERIFIER_nondet_float() [L119] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L119] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=4, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L122] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=10000, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L123] var_1_18 = __VERIFIER_nondet_ushort() [L124] CALL assume_abort_if_not(var_1_18 >= 8192) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L124] RET assume_abort_if_not(var_1_18 >= 8192) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] CALL assume_abort_if_not(var_1_18 <= 16384) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L125] RET assume_abort_if_not(var_1_18 <= 16384) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=5, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L126] var_1_19 = __VERIFIER_nondet_ushort() [L127] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L127] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L128] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L128] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_21=5, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L129] var_1_21 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L130] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L131] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L131] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=0, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L144] RET updateVariables() [L145] CALL step() [L48] COND TRUE (- var_1_2) > 31.9f [L49] var_1_1 = ((var_1_3 || var_1_4) && var_1_5) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L53] COND FALSE !((127.35 + var_1_2) <= var_1_7) VAL [isInitial=1, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L58] unsigned short int stepLocal_0 = var_1_10; VAL [isInitial=1, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=64] [L59] COND TRUE var_1_9 > stepLocal_0 [L60] var_1_8 = ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L62] unsigned char stepLocal_1 = var_1_12 < var_1_8; VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L63] COND FALSE !((! var_1_5) || stepLocal_1) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=8, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L70] COND TRUE \read(var_1_3) [L71] var_1_15 = var_1_16 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L73] unsigned char stepLocal_2 = var_1_9 < var_1_15; VAL [isInitial=1, stepLocal_2=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=2, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L74] COND TRUE var_1_3 || stepLocal_2 [L75] var_1_17 = (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L79] signed long int stepLocal_3 = -10; VAL [isInitial=1, stepLocal_3=-10, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L80] COND FALSE !(((var_1_17 / var_1_18) * var_1_19) < stepLocal_3) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=4, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L83] COND TRUE ! (var_1_21 <= var_1_10) [L84] var_1_20 = var_1_11 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=-32, var_1_23=0, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L89] var_1_22 = 1 [L90] var_1_23 = var_1_15 VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=2, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L145] RET step() [L146] CALL, EXPR property() [L136-L137] return ((((((((((- var_1_2) > 31.9f) ? (var_1_1 == ((unsigned char) ((var_1_3 || var_1_4) && var_1_5))) : (var_1_1 == ((unsigned char) var_1_5))) && (((127.35 + var_1_2) <= var_1_7) ? ((4.5 <= (var_1_7 * var_1_2)) ? (var_1_6 == ((unsigned char) var_1_5)) : 1) : 1)) && ((var_1_9 > var_1_10) ? (var_1_8 == ((signed char) ((((var_1_11) < (var_1_12)) ? (var_1_11) : (var_1_12))))) : 1)) && (((! var_1_5) || (var_1_12 < var_1_8)) ? ((! var_1_5) ? (var_1_13 == ((float) var_1_14)) : (var_1_13 == ((float) var_1_14))) : 1)) && (var_1_3 ? (var_1_15 == ((unsigned char) var_1_16)) : 1)) && ((var_1_3 || (var_1_9 < var_1_15)) ? (var_1_17 == ((unsigned short int) (var_1_15 + ((var_1_18 - var_1_16) + var_1_19)))) : (var_1_17 == ((unsigned short int) (var_1_16 + var_1_18))))) && ((((var_1_17 / var_1_18) * var_1_19) < -10) ? (var_1_20 == ((signed short int) ((((var_1_19) > (var_1_16)) ? (var_1_19) : (var_1_16))))) : ((! (var_1_21 <= var_1_10)) ? (var_1_20 == ((signed short int) var_1_11)) : (var_1_20 == ((signed short int) var_1_12))))) && (var_1_22 == ((signed char) 1))) && (var_1_23 == ((unsigned long int) var_1_15)) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=2, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L146] RET, EXPR property() [L146] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=2, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=8/5, var_1_15=2, var_1_16=2, var_1_17=24575, var_1_18=-122880, var_1_19=81919, var_1_1=1, var_1_20=0, var_1_21=1, var_1_22=1, var_1_23=2, var_1_3=1, var_1_4=1, var_1_5=1, var_1_6=0, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 76 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.1s, OverallIterations: 6, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 533 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 459 mSDsluCounter, 2008 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1415 mSDsCounter, 218 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2205 IncrementalHoareTripleChecker+Invalid, 2423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 218 mSolverCounterUnsat, 593 mSDtfsCounter, 2205 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 729 GetRequests, 635 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 7.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183occurred in iteration=4, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 159 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 1622 NumberOfCodeBlocks, 1622 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 805 ConstructedInterpolants, 0 QuantifiedInterpolants, 2993 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1084 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 5898/6000 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-11-10 03:33:02,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 03:33:04,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 03:33:04,775 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 03:33:04,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 03:33:04,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 03:33:04,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 03:33:04,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 03:33:04,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 03:33:04,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 03:33:04,816 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 03:33:04,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 03:33:04,817 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 03:33:04,817 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 03:33:04,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 03:33:04,818 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 03:33:04,819 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 03:33:04,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 03:33:04,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 03:33:04,820 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 03:33:04,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 03:33:04,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 03:33:04,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 03:33:04,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 03:33:04,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 03:33:04,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 03:33:04,834 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 03:33:04,834 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 03:33:04,834 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 03:33:04,834 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 03:33:04,835 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 03:33:04,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 03:33:04,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 03:33:04,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 03:33:04,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 03:33:04,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:33:04,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 03:33:04,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 03:33:04,837 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 03:33:04,837 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 03:33:04,837 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 03:33:04,838 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 03:33:04,839 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 03:33:04,840 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 03:33:04,840 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 03:33:04,841 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 98a19e0c547f7d3a72a6b0e726de4b196c22b807120fe6fe181da2453cf1b645 [2024-11-10 03:33:05,172 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 03:33:05,199 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 03:33:05,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 03:33:05,205 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 03:33:05,206 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 03:33:05,208 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-11-10 03:33:06,824 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 03:33:07,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 03:33:07,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i [2024-11-10 03:33:07,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31bc53e5/ccedc771bdbf41a5a3ace6a7530f5c35/FLAGa417dd5e4 [2024-11-10 03:33:07,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d31bc53e5/ccedc771bdbf41a5a3ace6a7530f5c35 [2024-11-10 03:33:07,075 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 03:33:07,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 03:33:07,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 03:33:07,077 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 03:33:07,086 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 03:33:07,087 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6534445f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07, skipping insertion in model container [2024-11-10 03:33:07,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,119 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 03:33:07,343 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i[917,930] [2024-11-10 03:33:07,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:33:07,445 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 03:33:07,457 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-41.i[917,930] [2024-11-10 03:33:07,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 03:33:07,529 INFO L204 MainTranslator]: Completed translation [2024-11-10 03:33:07,529 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07 WrapperNode [2024-11-10 03:33:07,529 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 03:33:07,530 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 03:33:07,531 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 03:33:07,531 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 03:33:07,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,593 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2024-11-10 03:33:07,597 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 03:33:07,598 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 03:33:07,598 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 03:33:07,598 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 03:33:07,610 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,619 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,642 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-11-10 03:33:07,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,656 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,656 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,663 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 03:33:07,676 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 03:33:07,676 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 03:33:07,676 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 03:33:07,677 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (1/1) ... [2024-11-10 03:33:07,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 03:33:07,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 03:33:07,729 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 03:33:07,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 03:33:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 03:33:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 03:33:07,787 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 03:33:07,788 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 03:33:07,788 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 03:33:07,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 03:33:07,901 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 03:33:07,905 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 03:33:20,454 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-10 03:33:20,457 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 03:33:20,471 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 03:33:20,472 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 03:33:20,472 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:20 BoogieIcfgContainer [2024-11-10 03:33:20,473 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 03:33:20,475 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 03:33:20,475 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 03:33:20,479 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 03:33:20,479 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:33:07" (1/3) ... [2024-11-10 03:33:20,480 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2531fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:20, skipping insertion in model container [2024-11-10 03:33:20,480 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:33:07" (2/3) ... [2024-11-10 03:33:20,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2531fd8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:33:20, skipping insertion in model container [2024-11-10 03:33:20,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:33:20" (3/3) ... [2024-11-10 03:33:20,482 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-41.i [2024-11-10 03:33:20,500 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 03:33:20,500 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 03:33:20,576 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 03:33:20,586 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;@223e95c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 03:33:20,587 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 03:33:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:33:20,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:33:20,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:20,611 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:33:20,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:20,618 INFO L85 PathProgramCache]: Analyzing trace with hash -815582234, now seen corresponding path program 1 times [2024-11-10 03:33:20,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:33:20,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1896560670] [2024-11-10 03:33:20,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:20,639 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-11-10 03:33:20,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:33:20,643 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:33:20,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 03:33:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:21,177 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 03:33:21,191 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 03:33:21,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 368 proven. 0 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2024-11-10 03:33:21,255 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 03:33:21,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 03:33:21,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1896560670] [2024-11-10 03:33:21,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1896560670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 03:33:21,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 03:33:21,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 03:33:21,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983233688] [2024-11-10 03:33:21,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 03:33:21,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 03:33:21,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 03:33:21,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 03:33:21,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 03:33:21,299 INFO L87 Difference]: Start difference. First operand has 76 states, 48 states have (on average 1.3125) internal successors, (63), 49 states have internal predecessors, (63), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:33:21,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 03:33:21,337 INFO L93 Difference]: Finished difference Result 144 states and 244 transitions. [2024-11-10 03:33:21,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 03:33:21,339 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 162 [2024-11-10 03:33:21,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 03:33:21,346 INFO L225 Difference]: With dead ends: 144 [2024-11-10 03:33:21,346 INFO L226 Difference]: Without dead ends: 71 [2024-11-10 03:33:21,350 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 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-11-10 03:33:21,353 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 03:33:21,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 03:33:21,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-10 03:33:21,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-10 03:33:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-10 03:33:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 105 transitions. [2024-11-10 03:33:21,398 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 105 transitions. Word has length 162 [2024-11-10 03:33:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 03:33:21,399 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 105 transitions. [2024-11-10 03:33:21,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.0) internal successors, (44), 2 states have internal predecessors, (44), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-10 03:33:21,400 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 105 transitions. [2024-11-10 03:33:21,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-10 03:33:21,406 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 03:33:21,406 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-10 03:33:21,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 03:33:21,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 03:33:21,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 03:33:21,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 03:33:21,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1134080359, now seen corresponding path program 1 times [2024-11-10 03:33:21,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 03:33:21,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509856974] [2024-11-10 03:33:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 03:33:21,615 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-11-10 03:33:21,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 03:33:21,619 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 03:33:21,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 03:33:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 03:33:22,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-10 03:33:22,032 INFO L278 TraceCheckSpWp]: Computing forward predicates...