./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:19:10,106 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:19:10,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:19:10,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:19:10,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:19:10,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:19:10,187 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:19:10,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:19:10,190 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:19:10,191 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:19:10,192 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:19:10,192 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:19:10,192 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:19:10,192 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:19:10,193 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:19:10,193 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:19:10,193 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:19:10,193 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:19:10,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:19:10,194 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:19:10,194 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:19:10,197 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:19:10,197 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:19:10,197 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:19:10,197 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:19:10,198 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:19:10,198 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:19:10,198 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:19:10,198 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:19:10,198 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:19:10,199 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:19:10,199 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:19:10,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:19:10,200 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:19:10,200 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:19:10,200 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:19:10,201 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:19:10,201 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:19:10,201 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:19:10,201 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:19:10,201 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:19:10,202 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:19:10,202 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 [2024-11-12 05:19:10,406 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:19:10,426 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:19:10,428 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:19:10,429 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:19:10,429 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:19:10,431 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-12 05:19:11,707 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:19:11,857 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:19:11,857 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-12 05:19:11,864 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6499de5/f29c5b8268a644ba9756a8f2ffaa285e/FLAG1b489309a [2024-11-12 05:19:11,877 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea6499de5/f29c5b8268a644ba9756a8f2ffaa285e [2024-11-12 05:19:11,880 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:19:11,881 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:19:11,883 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:19:11,883 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:19:11,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:19:11,887 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:19:11" (1/1) ... [2024-11-12 05:19:11,888 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@714d9435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:11, skipping insertion in model container [2024-11-12 05:19:11,888 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:19:11" (1/1) ... [2024-11-12 05:19:11,906 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:19:12,034 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i[914,927] [2024-11-12 05:19:12,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:19:12,093 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:19:12,103 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i[914,927] [2024-11-12 05:19:12,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:19:12,146 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:19:12,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12 WrapperNode [2024-11-12 05:19:12,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:19:12,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:19:12,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:19:12,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:19:12,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,182 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-12 05:19:12,182 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:19:12,183 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:19:12,183 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:19:12,183 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:19:12,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,209 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:19:12,209 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,209 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,213 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,216 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,217 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,218 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,219 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:19:12,220 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:19:12,220 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:19:12,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:19:12,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (1/1) ... [2024-11-12 05:19:12,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:19:12,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:19:12,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:19:12,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:19:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:19:12,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:19:12,295 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:19:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:19:12,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:19:12,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:19:12,356 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:19:12,358 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:19:12,537 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 05:19:12,537 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:19:12,548 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:19:12,548 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:19:12,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:19:12 BoogieIcfgContainer [2024-11-12 05:19:12,548 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:19:12,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:19:12,551 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:19:12,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:19:12,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:19:11" (1/3) ... [2024-11-12 05:19:12,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5445e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:19:12, skipping insertion in model container [2024-11-12 05:19:12,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:12" (2/3) ... [2024-11-12 05:19:12,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5445e902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:19:12, skipping insertion in model container [2024-11-12 05:19:12,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:19:12" (3/3) ... [2024-11-12 05:19:12,556 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-12 05:19:12,571 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:19:12,571 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:19:12,628 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:19:12,634 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;@64f63357, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:19:12,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:19:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:19:12,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 05:19:12,645 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:19:12,646 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:19:12,646 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:19:12,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:19:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 104122836, now seen corresponding path program 1 times [2024-11-12 05:19:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:19:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666315449] [2024-11-12 05:19:12,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:19:12,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:19:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:19:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:19:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:19:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:19:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:19:12,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:19:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:19:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:19:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:19:12,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:19:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:19:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:19:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:19:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:19:12,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:12,943 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-12 05:19:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:19:12,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666315449] [2024-11-12 05:19:12,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666315449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:19:12,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:19:12,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:19:12,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473338738] [2024-11-12 05:19:12,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:19:12,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:19:12,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:19:12,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:19:12,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:19:12,975 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:19:13,021 INFO L93 Difference]: Finished difference Result 97 states and 156 transitions. [2024-11-12 05:19:13,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:19:13,037 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-12 05:19:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:19:13,043 INFO L225 Difference]: With dead ends: 97 [2024-11-12 05:19:13,044 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 05:19:13,048 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:19:13,053 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:19:13,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:19:13,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 05:19:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 05:19:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:19:13,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-12 05:19:13,084 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 97 [2024-11-12 05:19:13,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:19:13,084 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-12 05:19:13,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:13,085 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-12 05:19:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 05:19:13,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:19:13,089 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:19:13,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:19:13,089 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:19:13,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:19:13,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1453420334, now seen corresponding path program 1 times [2024-11-12 05:19:13,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:19:13,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147179758] [2024-11-12 05:19:13,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:19:13,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:19:13,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:19:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 05:19:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:19:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 05:19:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-12 05:19:13,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-12 05:19:13,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 05:19:13,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 05:19:13,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 05:19:13,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 05:19:13,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 05:19:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-12 05:19:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-12 05:19:13,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-12 05:19:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 39 proven. 3 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-12 05:19:13,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:19:13,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147179758] [2024-11-12 05:19:13,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147179758] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:19:13,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351553947] [2024-11-12 05:19:13,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:13,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:19:13,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:19:13,597 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-12 05:19:13,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:19:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:13,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-12 05:19:13,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:19:13,836 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-12 05:19:13,836 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:19:13,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351553947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:19:13,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:19:13,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 10 [2024-11-12 05:19:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929445758] [2024-11-12 05:19:13,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:19:13,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:19:13,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:19:13,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:19:13,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-12 05:19:13,842 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:14,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:19:14,243 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2024-11-12 05:19:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 05:19:14,244 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-12 05:19:14,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:19:14,246 INFO L225 Difference]: With dead ends: 123 [2024-11-12 05:19:14,247 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 05:19:14,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2024-11-12 05:19:14,250 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 109 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:19:14,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 201 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:19:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 05:19:14,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-12 05:19:14,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:19:14,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-12 05:19:14,273 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 97 [2024-11-12 05:19:14,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:19:14,274 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-12 05:19:14,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:14,274 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-12 05:19:14,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 05:19:14,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:19:14,276 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:19:14,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:19:14,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:19:14,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:19:14,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:19:14,481 INFO L85 PathProgramCache]: Analyzing trace with hash -773361964, now seen corresponding path program 1 times [2024-11-12 05:19:14,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:19:14,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252212439] [2024-11-12 05:19:14,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:14,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:19:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:19:14,561 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-12 05:19:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-12 05:19:14,642 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-12 05:19:14,642 INFO L339 BasicCegarLoop]: Counterexample is feasible [2024-11-12 05:19:14,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-12 05:19:14,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-12 05:19:14,651 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-12 05:19:14,713 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-12 05:19:14,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 05:19:14 BoogieIcfgContainer [2024-11-12 05:19:14,724 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-12 05:19:14,725 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-12 05:19:14,725 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-12 05:19:14,725 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-12 05:19:14,726 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:19:12" (3/4) ... [2024-11-12 05:19:14,728 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-12 05:19:14,729 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-12 05:19:14,731 INFO L158 Benchmark]: Toolchain (without parser) took 2848.50ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 76.0MB in the beginning and 165.0MB in the end (delta: -89.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:19:14,733 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:19:14,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.82ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 75.8MB in the beginning and 187.7MB in the end (delta: -111.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2024-11-12 05:19:14,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.42ms. Allocated memory is still 216.0MB. Free memory was 187.7MB in the beginning and 185.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:19:14,734 INFO L158 Benchmark]: Boogie Preprocessor took 36.30ms. Allocated memory is still 216.0MB. Free memory was 185.6MB in the beginning and 183.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-12 05:19:14,734 INFO L158 Benchmark]: RCFGBuilder took 328.48ms. Allocated memory is still 216.0MB. Free memory was 183.5MB in the beginning and 166.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-12 05:19:14,734 INFO L158 Benchmark]: TraceAbstraction took 2173.77ms. Allocated memory is still 216.0MB. Free memory was 165.6MB in the beginning and 165.0MB in the end (delta: 600.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:19:14,734 INFO L158 Benchmark]: Witness Printer took 4.60ms. Allocated memory is still 216.0MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-12 05:19:14,735 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.11ms. Allocated memory is still 146.8MB. Free memory is still 98.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.82ms. Allocated memory was 146.8MB in the beginning and 216.0MB in the end (delta: 69.2MB). Free memory was 75.8MB in the beginning and 187.7MB in the end (delta: -111.9MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.42ms. Allocated memory is still 216.0MB. Free memory was 187.7MB in the beginning and 185.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.30ms. Allocated memory is still 216.0MB. Free memory was 185.6MB in the beginning and 183.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 328.48ms. Allocated memory is still 216.0MB. Free memory was 183.5MB in the beginning and 166.7MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2173.77ms. Allocated memory is still 216.0MB. Free memory was 165.6MB in the beginning and 165.0MB in the end (delta: 600.4kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.60ms. Allocated memory is still 216.0MB. Free memory is still 165.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 89. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] signed long int var_1_6 = -64; [L26] signed long int var_1_7 = -5; [L27] signed long int var_1_8 = 500; [L28] signed long int var_1_9 = -5; [L29] signed long int var_1_10 = -100; [L30] unsigned char var_1_11 = 1; [L31] double var_1_12 = 127.5; [L32] double var_1_13 = 7.25; [L33] unsigned char var_1_14 = 1; [L34] unsigned char var_1_15 = 0; VAL [isInitial=0, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L93] isInitial = 1 [L94] FCALL initially() [L95] int k_loop; [L96] k_loop = 0 VAL [isInitial=1, k_loop=0, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L96] COND TRUE k_loop < 1 [L97] FCALL updateLastVariables() [L98] CALL updateVariables() [L62] var_1_4 = __VERIFIER_nondet_uchar() [L63] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L63] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L64] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L65] var_1_5 = __VERIFIER_nondet_uchar() [L66] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L66] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L67] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=-5, var_1_8=500, var_1_9=-5] [L68] var_1_7 = __VERIFIER_nondet_long() [L69] CALL assume_abort_if_not(var_1_7 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L69] RET assume_abort_if_not(var_1_7 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L70] CALL assume_abort_if_not(var_1_7 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L70] RET assume_abort_if_not(var_1_7 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=500, var_1_9=-5] [L71] var_1_8 = __VERIFIER_nondet_long() [L72] CALL assume_abort_if_not(var_1_8 >= -1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L72] RET assume_abort_if_not(var_1_8 >= -1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L73] CALL assume_abort_if_not(var_1_8 <= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L73] RET assume_abort_if_not(var_1_8 <= 1073741823) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=-5] [L74] var_1_9 = __VERIFIER_nondet_long() [L75] CALL assume_abort_if_not(var_1_9 >= -536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L75] RET assume_abort_if_not(var_1_9 >= -536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L76] CALL assume_abort_if_not(var_1_9 <= 536870912) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L76] RET assume_abort_if_not(var_1_9 <= 536870912) VAL [isInitial=1, var_1_10=-100, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L77] var_1_10 = __VERIFIER_nondet_long() [L78] CALL assume_abort_if_not(var_1_10 >= -536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L78] RET assume_abort_if_not(var_1_10 >= -536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L79] CALL assume_abort_if_not(var_1_10 <= 536870911) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L79] RET assume_abort_if_not(var_1_10 <= 536870911) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_13=29/4, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L80] var_1_13 = __VERIFIER_nondet_double() [L81] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L81] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=0, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L82] var_1_15 = __VERIFIER_nondet_uchar() [L83] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L83] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L84] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L84] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=255/2, var_1_14=1, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L98] RET updateVariables() [L99] CALL step() [L38] var_1_12 = var_1_13 [L39] var_1_14 = var_1_15 VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=-64, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L40] COND FALSE !(! var_1_14) [L43] var_1_6 = ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L45] signed long int stepLocal_2 = var_1_7; [L46] signed long int stepLocal_1 = var_1_9; VAL [isInitial=1, stepLocal_1=536870912, stepLocal_2=1073741821, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L47] COND FALSE !(var_1_8 <= stepLocal_2) VAL [isInitial=1, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L54] unsigned char stepLocal_0 = var_1_14; VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L55] COND FALSE !(! var_1_11) VAL [isInitial=1, stepLocal_0=-255, stepLocal_1=536870912, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L99] RET step() [L100] CALL, EXPR property() [L89-L90] return (((((! var_1_11) ? ((var_1_11 && var_1_14) ? (var_1_1 == ((unsigned char) (var_1_4 || var_1_5))) : 1) : 1) && ((! var_1_14) ? (var_1_6 == ((signed long int) (var_1_7 + var_1_8))) : (var_1_6 == ((signed long int) ((((((var_1_9) < 0 ) ? -(var_1_9) : (var_1_9))) + var_1_10) + var_1_7))))) && ((var_1_8 <= var_1_7) ? ((var_1_10 >= var_1_9) ? (var_1_11 == ((unsigned char) (! var_1_5))) : (var_1_11 == ((unsigned char) (var_1_14 || (! var_1_5))))) : 1)) && (var_1_12 == ((double) var_1_13))) && (var_1_14 == ((unsigned char) var_1_15)) ; VAL [\result=0, isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L100] RET, EXPR property() [L100] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] [L19] reach_error() VAL [isInitial=1, var_1_10=536870911, var_1_11=1, var_1_12=2147483649, var_1_13=2147483649, var_1_14=-255, var_1_15=-255, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=2147483644, var_1_7=1073741821, var_1_8=1073741822, var_1_9=536870912] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 123 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 270 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 252 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 136 mSDtfsCounter, 252 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 190 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=75occurred in iteration=2, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 388 NumberOfCodeBlocks, 388 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 370 SizeOfPredicates, 1 NumberOfNonLiveVariables, 230 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1257/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-12 05:19:14,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:19:16,710 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:19:16,781 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-12 05:19:16,786 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:19:16,787 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:19:16,816 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:19:16,817 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:19:16,817 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:19:16,817 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:19:16,818 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:19:16,819 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:19:16,819 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:19:16,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:19:16,821 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:19:16,821 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:19:16,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:19:16,822 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:19:16,822 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:19:16,822 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:19:16,823 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:19:16,823 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:19:16,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:19:16,826 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:19:16,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-12 05:19:16,826 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-12 05:19:16,826 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:19:16,827 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-12 05:19:16,827 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:19:16,827 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:19:16,827 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:19:16,827 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:19:16,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:19:16,828 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:19:16,828 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:19:16,828 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:19:16,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:19:16,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:19:16,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:19:16,829 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-12 05:19:16,829 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-12 05:19:16,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:19:16,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:19:16,831 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:19:16,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:19:16,831 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4174816ef344926bad8876b5a23c69137012cf10d2912eee66c6eaf9797b3d25 [2024-11-12 05:19:17,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:19:17,145 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:19:17,148 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:19:17,149 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:19:17,149 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:19:17,150 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-12 05:19:18,520 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:19:18,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:19:18,704 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-12 05:19:18,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca1db6df/4388d8c64e7f455b9dfabee115f8ef24/FLAG374049355 [2024-11-12 05:19:18,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ca1db6df/4388d8c64e7f455b9dfabee115f8ef24 [2024-11-12 05:19:18,736 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:19:18,737 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:19:18,739 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:19:18,740 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:19:18,744 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:19:18,745 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:19:18" (1/1) ... [2024-11-12 05:19:18,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7eaef120 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:18, skipping insertion in model container [2024-11-12 05:19:18,747 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:19:18" (1/1) ... [2024-11-12 05:19:18,770 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:19:18,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i[914,927] [2024-11-12 05:19:18,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:19:18,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:19:18,991 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-3.i[914,927] [2024-11-12 05:19:19,012 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:19:19,036 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:19:19,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19 WrapperNode [2024-11-12 05:19:19,037 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:19:19,038 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:19:19,038 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:19:19,038 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:19:19,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,064 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,091 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-12 05:19:19,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:19:19,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:19:19,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:19:19,095 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:19:19,105 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,105 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,129 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:19:19,133 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,133 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,143 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,151 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:19:19,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:19:19,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:19:19,162 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:19:19,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (1/1) ... [2024-11-12 05:19:19,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:19:19,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:19:19,196 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:19:19,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:19:19,248 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:19:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-12 05:19:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:19:19,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:19:19,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:19:19,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:19:19,313 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:19:19,315 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:19:19,498 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-12 05:19:19,499 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:19:19,509 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:19:19,509 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:19:19,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:19:19 BoogieIcfgContainer [2024-11-12 05:19:19,509 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:19:19,511 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:19:19,511 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:19:19,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:19:19,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:19:18" (1/3) ... [2024-11-12 05:19:19,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25385219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:19:19, skipping insertion in model container [2024-11-12 05:19:19,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:19:19" (2/3) ... [2024-11-12 05:19:19,515 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25385219 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:19:19, skipping insertion in model container [2024-11-12 05:19:19,515 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:19:19" (3/3) ... [2024-11-12 05:19:19,517 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-3.i [2024-11-12 05:19:19,537 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:19:19,537 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:19:19,587 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:19:19,592 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;@6f461013, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:19:19,593 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:19:19,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:19:19,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 05:19:19,605 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:19:19,605 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:19:19,606 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:19:19,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:19:19,611 INFO L85 PathProgramCache]: Analyzing trace with hash 104122836, now seen corresponding path program 1 times [2024-11-12 05:19:19,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:19:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846527734] [2024-11-12 05:19:19,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:19,621 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:19:19,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:19:19,624 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:19:19,625 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-12 05:19:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:19,787 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-12 05:19:19,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:19:19,830 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 208 proven. 0 refuted. 0 times theorem prover too weak. 212 trivial. 0 not checked. [2024-11-12 05:19:19,830 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:19:19,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:19:19,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846527734] [2024-11-12 05:19:19,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846527734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:19:19,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:19:19,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:19:19,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710422288] [2024-11-12 05:19:19,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:19:19,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:19:19,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:19:19,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:19:19,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:19:19,858 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:19:19,884 INFO L93 Difference]: Finished difference Result 97 states and 156 transitions. [2024-11-12 05:19:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:19:19,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-12 05:19:19,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:19:19,893 INFO L225 Difference]: With dead ends: 97 [2024-11-12 05:19:19,893 INFO L226 Difference]: Without dead ends: 46 [2024-11-12 05:19:19,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:19:19,899 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:19:19,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:19:19,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-12 05:19:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-11-12 05:19:19,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-12 05:19:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2024-11-12 05:19:19,959 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 97 [2024-11-12 05:19:19,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:19:19,959 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2024-11-12 05:19:19,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:19,960 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2024-11-12 05:19:19,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 05:19:19,964 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:19:19,965 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:19:19,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-12 05:19:20,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:19:20,166 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:19:20,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:19:20,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1453420334, now seen corresponding path program 1 times [2024-11-12 05:19:20,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:19:20,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504865843] [2024-11-12 05:19:20,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:20,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:19:20,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:19:20,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:19:20,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-12 05:19:20,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:20,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-12 05:19:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:19:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2024-11-12 05:19:20,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 05:19:20,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-12 05:19:20,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504865843] [2024-11-12 05:19:20,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504865843] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:19:20,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:19:20,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-12 05:19:20,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612564540] [2024-11-12 05:19:20,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:19:20,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:19:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-12 05:19:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:19:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-12 05:19:20,443 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:20,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:19:20,913 INFO L93 Difference]: Finished difference Result 123 states and 172 transitions. [2024-11-12 05:19:20,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 05:19:20,914 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 97 [2024-11-12 05:19:20,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:19:20,916 INFO L225 Difference]: With dead ends: 123 [2024-11-12 05:19:20,916 INFO L226 Difference]: Without dead ends: 80 [2024-11-12 05:19:20,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2024-11-12 05:19:20,919 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 109 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-12 05:19:20,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 166 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-12 05:19:20,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-11-12 05:19:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2024-11-12 05:19:20,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 44 states have internal predecessors, (48), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-12 05:19:20,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2024-11-12 05:19:20,942 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 97 [2024-11-12 05:19:20,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:19:20,942 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2024-11-12 05:19:20,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 7 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-12 05:19:20,942 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2024-11-12 05:19:20,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-12 05:19:20,947 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:19:20,947 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:19:20,953 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-12 05:19:21,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:19:21,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:19:21,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:19:21,149 INFO L85 PathProgramCache]: Analyzing trace with hash -773361964, now seen corresponding path program 1 times [2024-11-12 05:19:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-12 05:19:21,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1478123657] [2024-11-12 05:19:21,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:19:21,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-12 05:19:21,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-12 05:19:21,152 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-12 05:19:21,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-12 05:19:21,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:19:21,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-12 05:19:21,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:20:42,642 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 157 proven. 128 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-12 05:20:42,643 INFO L312 TraceCheckSpWp]: Computing backward predicates...