./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:54:01,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:54:01,563 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 11:54:01,570 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:54:01,571 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:54:01,606 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:54:01,606 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:54:01,607 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:54:01,608 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:54:01,609 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:54:01,609 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:54:01,609 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:54:01,610 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:54:01,612 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:54:01,612 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:54:01,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:54:01,613 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:54:01,613 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:54:01,613 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 11:54:01,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:54:01,614 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:54:01,614 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:54:01,617 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:54:01,618 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:54:01,618 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:54:01,618 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:54:01,618 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:54:01,619 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:54:01,619 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:54:01,619 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:54:01,619 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:54:01,620 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:54:01,620 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:01,620 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:54:01,620 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:54:01,620 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:54:01,621 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 11:54:01,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 11:54:01,621 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:54:01,621 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:54:01,622 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:54:01,623 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:54:01,623 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 [2024-10-11 11:54:01,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:54:01,887 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:54:01,891 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:54:01,892 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:54:01,892 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:54:01,893 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-10-11 11:54:03,254 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:54:03,464 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:54:03,465 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-10-11 11:54:03,477 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c7d2595a/3bd75b15a6624c428f7173165532f559/FLAG3af645922 [2024-10-11 11:54:03,830 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1c7d2595a/3bd75b15a6624c428f7173165532f559 [2024-10-11 11:54:03,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:54:03,834 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:54:03,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:03,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:54:03,842 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:54:03,843 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:03" (1/1) ... [2024-10-11 11:54:03,844 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@461a21e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:03, skipping insertion in model container [2024-10-11 11:54:03,844 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:03" (1/1) ... [2024-10-11 11:54:03,880 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:54:04,042 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-10-11 11:54:04,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:04,110 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:54:04,122 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-10-11 11:54:04,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:04,182 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:54:04,182 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04 WrapperNode [2024-10-11 11:54:04,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:04,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:04,184 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:54:04,184 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:54:04,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,210 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,251 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-10-11 11:54:04,252 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:04,253 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:54:04,253 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:54:04,253 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:54:04,264 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,308 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:54:04,310 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,310 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,325 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,328 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,331 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,334 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:54:04,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:54:04,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:54:04,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:54:04,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (1/1) ... [2024-10-11 11:54:04,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:04,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:04,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:54:04,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:54:04,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:54:04,424 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:54:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:54:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 11:54:04,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:54:04,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:54:04,508 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:54:04,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:54:04,956 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-11 11:54:04,956 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:54:04,993 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:54:04,994 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:54:04,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:04 BoogieIcfgContainer [2024-10-11 11:54:04,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:54:05,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:54:05,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:54:05,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:54:05,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:54:03" (1/3) ... [2024-10-11 11:54:05,023 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77221aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:05, skipping insertion in model container [2024-10-11 11:54:05,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:04" (2/3) ... [2024-10-11 11:54:05,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77221aaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:05, skipping insertion in model container [2024-10-11 11:54:05,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:04" (3/3) ... [2024-10-11 11:54:05,026 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-10-11 11:54:05,042 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:54:05,042 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:54:05,126 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:54:05,135 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;@44b72749, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:54:05,136 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:54:05,140 INFO L276 IsEmpty]: Start isEmpty. Operand has 72 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:54:05,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 11:54:05,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:05,158 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:05,158 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:05,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash 351381721, now seen corresponding path program 1 times [2024-10-11 11:54:05,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:05,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283129489] [2024-10-11 11:54:05,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:05,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:05,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:05,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:05,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:05,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:54:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:05,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:54:05,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:54:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:54:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:54:05,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:54:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:54:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:54:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:54:05,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:54:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:05,523 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-11 11:54:05,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:05,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283129489] [2024-10-11 11:54:05,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283129489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:05,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:05,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:54:05,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395834247] [2024-10-11 11:54:05,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:05,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:54:05,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:05,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:54:05,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:54:05,559 INFO L87 Difference]: Start difference. First operand has 72 states, 50 states have (on average 1.52) internal successors, (76), 51 states have internal predecessors, (76), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:54:05,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:05,607 INFO L93 Difference]: Finished difference Result 143 states and 246 transitions. [2024-10-11 11:54:05,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:54:05,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 120 [2024-10-11 11:54:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:05,620 INFO L225 Difference]: With dead ends: 143 [2024-10-11 11:54:05,620 INFO L226 Difference]: Without dead ends: 70 [2024-10-11 11:54:05,624 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:54:05,629 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:05,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 11:54:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-11 11:54:05,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-11 11:54:05,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 49 states have (on average 1.4489795918367347) internal successors, (71), 49 states have internal predecessors, (71), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:54:05,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 109 transitions. [2024-10-11 11:54:05,680 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 109 transitions. Word has length 120 [2024-10-11 11:54:05,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:05,681 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 109 transitions. [2024-10-11 11:54:05,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:54:05,682 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 109 transitions. [2024-10-11 11:54:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 11:54:05,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:05,687 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:05,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 11:54:05,688 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:05,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:05,688 INFO L85 PathProgramCache]: Analyzing trace with hash 72878943, now seen corresponding path program 1 times [2024-10-11 11:54:05,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851207335] [2024-10-11 11:54:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 11:54:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 11:54:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 11:54:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 11:54:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 11:54:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 11:54:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:06,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 11:54:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 11:54:07,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 11:54:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 11:54:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 11:54:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 11:54:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 11:54:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 11:54:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 11:54:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 11:54:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 11:54:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 11:54:07,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 11:54:07,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 108 proven. 102 refuted. 0 times theorem prover too weak. 474 trivial. 0 not checked. [2024-10-11 11:54:07,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 11:54:07,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851207335] [2024-10-11 11:54:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851207335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:54:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923728451] [2024-10-11 11:54:07,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:07,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:54:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:07,205 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:54:07,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 11:54:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:07,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-11 11:54:07,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:54:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 446 proven. 141 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2024-10-11 11:54:08,656 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 11:54:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [923728451] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 11:54:15,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 11:54:15,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 18] total 22 [2024-10-11 11:54:15,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192559580] [2024-10-11 11:54:15,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 11:54:15,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 11:54:15,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 11:54:15,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 11:54:15,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=731, Unknown=0, NotChecked=0, Total=930 [2024-10-11 11:54:15,373 INFO L87 Difference]: Start difference. First operand 70 states and 109 transitions. Second operand has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2024-10-11 11:54:16,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:16,471 INFO L93 Difference]: Finished difference Result 167 states and 240 transitions. [2024-10-11 11:54:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-11 11:54:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) Word has length 120 [2024-10-11 11:54:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:16,476 INFO L225 Difference]: With dead ends: 167 [2024-10-11 11:54:16,476 INFO L226 Difference]: Without dead ends: 98 [2024-10-11 11:54:16,479 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 211 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=691, Invalid=1961, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 11:54:16,480 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 435 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:16,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 304 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 11:54:16,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-11 11:54:16,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2024-10-11 11:54:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 19 states have call successors, (19), 6 states have call predecessors, (19), 6 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:54:16,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 122 transitions. [2024-10-11 11:54:16,510 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 122 transitions. Word has length 120 [2024-10-11 11:54:16,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:16,511 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 122 transitions. [2024-10-11 11:54:16,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.9545454545454546) internal successors, (65), 21 states have internal predecessors, (65), 9 states have call successors, (31), 6 states have call predecessors, (31), 10 states have return successors, (32), 9 states have call predecessors, (32), 9 states have call successors, (32) [2024-10-11 11:54:16,512 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 122 transitions. [2024-10-11 11:54:16,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 11:54:16,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:16,515 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:16,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 11:54:16,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:54:16,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:16,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:16,716 INFO L85 PathProgramCache]: Analyzing trace with hash 128086828, now seen corresponding path program 1 times [2024-10-11 11:54:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 11:54:16,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471733613] [2024-10-11 11:54:16,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 11:54:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 11:54:16,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2121154451] [2024-10-11 11:54:16,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:16,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:54:16,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:16,794 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 11:54:16,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 11:54:17,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:54:17,138 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 11:54:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 11:54:17,248 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 11:54:17,249 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 11:54:17,250 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 11:54:17,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 11:54:17,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 11:54:17,455 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 11:54:17,544 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 11:54:17,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 11:54:17 BoogieIcfgContainer [2024-10-11 11:54:17,547 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 11:54:17,548 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 11:54:17,548 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 11:54:17,548 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 11:54:17,549 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:04" (3/4) ... [2024-10-11 11:54:17,551 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 11:54:17,552 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 11:54:17,553 INFO L158 Benchmark]: Toolchain (without parser) took 13719.12ms. Allocated memory was 176.2MB in the beginning and 295.7MB in the end (delta: 119.5MB). Free memory was 124.1MB in the beginning and 201.3MB in the end (delta: -77.3MB). Peak memory consumption was 42.9MB. Max. memory is 16.1GB. [2024-10-11 11:54:17,553 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:54:17,553 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.81ms. Allocated memory is still 176.2MB. Free memory was 124.1MB in the beginning and 108.2MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 11:54:17,554 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.82ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 103.1MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:54:17,554 INFO L158 Benchmark]: Boogie Preprocessor took 85.94ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 96.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 11:54:17,554 INFO L158 Benchmark]: RCFGBuilder took 654.90ms. Allocated memory is still 176.2MB. Free memory was 95.6MB in the beginning and 64.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-11 11:54:17,555 INFO L158 Benchmark]: TraceAbstraction took 12533.48ms. Allocated memory was 176.2MB in the beginning and 295.7MB in the end (delta: 119.5MB). Free memory was 142.6MB in the beginning and 201.3MB in the end (delta: -58.7MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-10-11 11:54:17,555 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 295.7MB. Free memory is still 201.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 11:54:17,557 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.20ms. Allocated memory is still 176.2MB. Free memory is still 139.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.81ms. Allocated memory is still 176.2MB. Free memory was 124.1MB in the beginning and 108.2MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.82ms. Allocated memory is still 176.2MB. Free memory was 108.2MB in the beginning and 103.1MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 85.94ms. Allocated memory is still 176.2MB. Free memory was 102.5MB in the beginning and 96.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 654.90ms. Allocated memory is still 176.2MB. Free memory was 95.6MB in the beginning and 64.1MB in the end (delta: 31.5MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 12533.48ms. Allocated memory was 176.2MB in the beginning and 295.7MB in the end (delta: 119.5MB). Free memory was 142.6MB in the beginning and 201.3MB in the end (delta: -58.7MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 295.7MB. Free memory is still 201.3MB. 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 106, overapproximation of someBinaryArithmeticFLOAToperation at line 43. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -25; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1230640054; [L25] signed long int var_1_6 = 1508873667; [L26] unsigned char var_1_7 = 64; [L27] unsigned char var_1_8 = 200; [L28] unsigned char var_1_9 = 16; [L29] unsigned char var_1_10 = 0; [L30] unsigned char var_1_11 = 8; [L31] float var_1_12 = 15.4; [L32] float var_1_16 = 10000000000000.375; [L33] float var_1_17 = 16.4; [L34] float var_1_18 = 8.5; [L35] float var_1_19 = 64.75; [L36] unsigned char var_1_20 = 16; [L37] signed char var_1_22 = 0; [L38] unsigned char var_1_23 = 16; [L110] isInitial = 1 [L111] FCALL initially() [L112] int k_loop; [L113] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=0, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L113] COND TRUE k_loop < 1 [L114] FCALL updateLastVariables() [L115] CALL updateVariables() [L73] var_1_2 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L74] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L75] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L75] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1230640054, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L76] var_1_3 = __VERIFIER_nondet_long() [L77] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L77] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L78] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L78] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1508873667, var_1_7=64, var_1_8=200, var_1_9=16] [L79] var_1_6 = __VERIFIER_nondet_long() [L80] CALL assume_abort_if_not(var_1_6 >= 1073741822) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L80] RET assume_abort_if_not(var_1_6 >= 1073741822) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L81] CALL assume_abort_if_not(var_1_6 <= 2147483646) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L81] RET assume_abort_if_not(var_1_6 <= 2147483646) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=200, var_1_9=16] [L82] var_1_8 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_8 >= 190) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=16] [L83] RET assume_abort_if_not(var_1_8 >= 190) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=16] [L84] CALL assume_abort_if_not(var_1_8 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=16] [L84] RET assume_abort_if_not(var_1_8 <= 254) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=16] [L85] var_1_9 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254] [L86] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254] [L87] CALL assume_abort_if_not(var_1_9 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L87] RET assume_abort_if_not(var_1_9 <= 63) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L88] var_1_10 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L89] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L90] CALL assume_abort_if_not(var_1_10 <= 32) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L90] RET assume_abort_if_not(var_1_10 <= 32) VAL [isInitial=1, var_1_10=0, var_1_11=8, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, var_1_10=0, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L93] CALL assume_abort_if_not(var_1_11 <= 31) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L93] RET assume_abort_if_not(var_1_11 <= 31) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_17=82/5, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L94] var_1_17 = __VERIFIER_nondet_float() [L95] CALL assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L95] RET assume_abort_if_not((var_1_17 >= -461168.6018427382800e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 4611686.018427382800e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_18=17/2, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L96] var_1_18 = __VERIFIER_nondet_float() [L97] CALL assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L97] RET assume_abort_if_not((var_1_18 >= -461168.6018427382800e+13F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=16, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L98] var_1_20 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_20 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L99] RET assume_abort_if_not(var_1_20 >= 1) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L100] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L100] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L101] CALL assume_abort_if_not(var_1_20 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L101] RET assume_abort_if_not(var_1_20 != 127) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_16=80000000000003/8, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=64, var_1_8=254, var_1_9=-256] [L115] RET updateVariables() [L116] CALL step() [L42] var_1_7 = ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11))) [L43] var_1_16 = (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18)))) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=16, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L44] COND FALSE !((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) [L51] var_1_23 = var_1_20 VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=-25, var_1_20=32, var_1_22=0, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_7) - var_1_7) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=0, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L58] signed long int stepLocal_1 = var_1_9 % (var_1_8 - var_1_20); VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=0, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L59] EXPR var_1_7 ^ var_1_10 VAL [isInitial=1, stepLocal_1=0, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=0, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L59] signed long int stepLocal_0 = var_1_7 ^ var_1_10; [L60] COND FALSE !(stepLocal_1 > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) VAL [isInitial=1, stepLocal_0=185, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=0, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L65] COND TRUE (var_1_11 % var_1_20) < var_1_1 [L66] var_1_22 = ((((10) > (var_1_10)) ? (10) : (var_1_10))) VAL [isInitial=1, stepLocal_0=185, var_1_10=0, var_1_11=31, var_1_12=77/5, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=10, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L68] COND TRUE ((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f)) [L69] var_1_12 = 31.5f VAL [isInitial=1, stepLocal_0=185, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=10, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L116] RET step() [L117] CALL, EXPR property() [L106] EXPR ((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=10, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L106-L107] return ((((((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_7) - var_1_7))) : (var_1_1 == ((signed long int) (((((var_1_3) > ((var_1_6 - var_1_7))) ? (var_1_3) : ((var_1_6 - var_1_7)))) - var_1_7)))) && (var_1_7 == ((unsigned char) ((var_1_8 - var_1_9) - (100 - (var_1_10 + var_1_11)))))) && ((((((var_1_16) > (var_1_16)) ? (var_1_16) : (var_1_16))) <= (- (var_1_19 / 4.9f))) ? (var_1_12 == ((float) 31.5f)) : 1)) && (var_1_16 == ((float) (var_1_17 + ((((var_1_18) < 0 ) ? -(var_1_18) : (var_1_18))))))) && (((var_1_9 % (var_1_8 - var_1_20)) > ((((var_1_23) < 0 ) ? -(var_1_23) : (var_1_23)))) ? (((var_1_3 ^ var_1_23) <= (var_1_7 ^ var_1_10)) ? (var_1_19 == ((float) var_1_17)) : 1) : 1)) && (((var_1_11 % var_1_20) < var_1_1) ? (var_1_22 == ((signed char) ((((10) > (var_1_10)) ? (10) : (var_1_10))))) : 1)) && (((3886175339u - var_1_20) <= (var_1_9 / var_1_3)) ? ((var_1_10 > var_1_7) ? (var_1_23 == ((unsigned char) ((((var_1_20) < ((var_1_8 - var_1_9))) ? (var_1_20) : ((var_1_8 - var_1_9)))))) : (var_1_23 == ((unsigned char) (((((var_1_20) > (64)) ? (var_1_20) : (64))) + var_1_11)))) : (var_1_23 == ((unsigned char) var_1_20))) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=10, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=31, var_1_12=63/2, var_1_19=259/4, var_1_1=1073741452, var_1_20=32, var_1_22=10, var_1_23=32, var_1_2=1, var_1_3=1073741822, var_1_6=1073741822, var_1_7=185, var_1_8=254, var_1_9=-256] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 72 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.4s, OverallIterations: 3, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 435 mSDsluCounter, 410 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 247 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 526 IncrementalHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 163 mSDtfsCounter, 526 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 322 GetRequests, 270 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=2, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 602 NumberOfCodeBlocks, 602 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 357 ConstructedInterpolants, 0 QuantifiedInterpolants, 3066 SizeOfPredicates, 5 NumberOfNonLiveVariables, 274 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 1809/2052 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-11 11:54:17,610 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 11:54:19,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 11:54:19,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 11:54:19,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 11:54:19,863 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 11:54:19,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 11:54:19,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 11:54:19,907 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 11:54:19,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 11:54:19,909 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 11:54:19,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 11:54:19,910 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 11:54:19,910 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 11:54:19,911 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 11:54:19,911 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 11:54:19,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 11:54:19,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 11:54:19,912 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 11:54:19,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 11:54:19,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 11:54:19,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 11:54:19,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 11:54:19,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 11:54:19,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 11:54:19,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 11:54:19,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 11:54:19,915 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 11:54:19,915 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 11:54:19,915 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 11:54:19,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 11:54:19,916 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 11:54:19,916 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 11:54:19,916 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 11:54:19,917 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 11:54:19,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:19,917 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 11:54:19,917 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 11:54:19,918 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 11:54:19,918 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 11:54:19,918 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 11:54:19,918 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 11:54:19,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 11:54:19,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 11:54:19,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 11:54:19,920 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 11:54:19,921 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f501d64c3ae6a1a87dafc1ae088b3f11ed9b8e87fd0c337a0ab1db4279d00583 [2024-10-11 11:54:20,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 11:54:20,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 11:54:20,207 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 11:54:20,208 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 11:54:20,209 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 11:54:20,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-10-11 11:54:21,764 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 11:54:21,977 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 11:54:21,978 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-10-11 11:54:21,990 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6482eaee8/f075e9b11d584b868927d36a975ec63f/FLAG0455c3548 [2024-10-11 11:54:22,006 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/6482eaee8/f075e9b11d584b868927d36a975ec63f [2024-10-11 11:54:22,008 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 11:54:22,010 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 11:54:22,013 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:22,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 11:54:22,018 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 11:54:22,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4af273cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22, skipping insertion in model container [2024-10-11 11:54:22,021 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,048 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 11:54:22,222 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-10-11 11:54:22,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:22,328 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 11:54:22,342 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-83.i[915,928] [2024-10-11 11:54:22,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 11:54:22,395 INFO L204 MainTranslator]: Completed translation [2024-10-11 11:54:22,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22 WrapperNode [2024-10-11 11:54:22,396 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 11:54:22,397 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:22,397 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 11:54:22,397 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 11:54:22,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,453 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 124 [2024-10-11 11:54:22,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 11:54:22,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 11:54:22,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 11:54:22,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 11:54:22,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 11:54:22,492 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,504 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,512 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,523 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 11:54:22,525 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 11:54:22,528 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 11:54:22,528 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 11:54:22,529 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (1/1) ... [2024-10-11 11:54:22,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 11:54:22,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 11:54:22,561 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 11:54:22,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 11:54:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 11:54:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 11:54:22,609 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 11:54:22,610 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 11:54:22,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 11:54:22,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 11:54:22,692 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 11:54:22,694 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 11:54:24,750 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 11:54:24,751 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 11:54:24,802 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 11:54:24,802 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 11:54:24,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:24 BoogieIcfgContainer [2024-10-11 11:54:24,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 11:54:24,805 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 11:54:24,805 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 11:54:24,808 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 11:54:24,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 11:54:22" (1/3) ... [2024-10-11 11:54:24,809 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec74818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:24, skipping insertion in model container [2024-10-11 11:54:24,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 11:54:22" (2/3) ... [2024-10-11 11:54:24,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec74818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 11:54:24, skipping insertion in model container [2024-10-11 11:54:24,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 11:54:24" (3/3) ... [2024-10-11 11:54:24,811 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-83.i [2024-10-11 11:54:24,826 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 11:54:24,827 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 11:54:24,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 11:54:24,896 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;@18ecd267, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 11:54:24,896 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 11:54:24,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:54:24,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 11:54:24,908 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:24,909 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:24,910 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:24,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:24,914 INFO L85 PathProgramCache]: Analyzing trace with hash -579684466, now seen corresponding path program 1 times [2024-10-11 11:54:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:54:24,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908172969] [2024-10-11 11:54:24,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:24,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:54:24,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:54:24,927 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:54:24,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-11 11:54:25,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:25,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 11:54:25,443 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:54:25,491 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 344 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-10-11 11:54:25,491 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 11:54:25,492 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 11:54:25,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908172969] [2024-10-11 11:54:25,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908172969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 11:54:25,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 11:54:25,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 11:54:25,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104168012] [2024-10-11 11:54:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 11:54:25,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 11:54:25,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 11:54:25,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 11:54:25,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:54:25,531 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:54:26,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 11:54:26,467 INFO L93 Difference]: Finished difference Result 99 states and 174 transitions. [2024-10-11 11:54:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 11:54:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 116 [2024-10-11 11:54:26,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 11:54:26,476 INFO L225 Difference]: With dead ends: 99 [2024-10-11 11:54:26,476 INFO L226 Difference]: Without dead ends: 48 [2024-10-11 11:54:26,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 11:54:26,481 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 11:54:26,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 11:54:26,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-11 11:54:26,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-11 11:54:26,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-11 11:54:26,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 73 transitions. [2024-10-11 11:54:26,518 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 73 transitions. Word has length 116 [2024-10-11 11:54:26,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 11:54:26,519 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 73 transitions. [2024-10-11 11:54:26,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-11 11:54:26,519 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 73 transitions. [2024-10-11 11:54:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 11:54:26,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 11:54:26,522 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 11:54:26,536 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 11:54:26,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:54:26,724 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 11:54:26,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 11:54:26,725 INFO L85 PathProgramCache]: Analyzing trace with hash 2110475540, now seen corresponding path program 1 times [2024-10-11 11:54:26,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 11:54:26,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1721848397] [2024-10-11 11:54:26,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 11:54:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-11 11:54:26,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 11:54:26,728 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-11 11:54:26,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-11 11:54:27,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 11:54:27,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 11:54:27,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 11:54:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 498 proven. 117 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-10-11 11:54:45,601 INFO L311 TraceCheckSpWp]: Computing backward predicates...