./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.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 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:12:04,541 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:12:04,596 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:12:04,604 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:12:04,604 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:12:04,625 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:12:04,626 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:12:04,626 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:12:04,627 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:12:04,627 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:12:04,628 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:12:04,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:12:04,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:12:04,629 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:12:04,629 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:12:04,630 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:12:04,634 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:12:04,634 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:12:04,635 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:12:04,635 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:12:04,635 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:12:04,638 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:12:04,638 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:12:04,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:12:04,639 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:12:04,639 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:12:04,639 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:12:04,639 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:12:04,640 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:12:04,640 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:12:04,640 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:12:04,640 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:12:04,640 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:12:04,641 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:12:04,641 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:12:04,641 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:12:04,642 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:12:04,642 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:12:04,642 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:12:04,642 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:12:04,643 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:12:04,644 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:12:04,644 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 -> 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 [2024-10-13 04:12:04,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:12:04,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:12:04,962 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:12:04,963 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:12:04,964 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:12:04,965 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2024-10-13 04:12:06,355 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:12:06,591 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:12:06,592 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2024-10-13 04:12:06,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30836bd03/1a8298d7054b45b785e278ce807bc72d/FLAGdfc95a8e1 [2024-10-13 04:12:06,622 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30836bd03/1a8298d7054b45b785e278ce807bc72d [2024-10-13 04:12:06,625 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:12:06,627 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:12:06,628 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:12:06,628 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:12:06,634 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:12:06,635 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:06,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dbb3465 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06, skipping insertion in model container [2024-10-13 04:12:06,638 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:06,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:12:06,846 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2024-10-13 04:12:06,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:12:06,914 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:12:06,931 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2024-10-13 04:12:06,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:12:06,978 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:12:06,979 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06 WrapperNode [2024-10-13 04:12:06,979 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:12:06,980 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:12:06,981 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:12:06,981 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:12:06,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:06,996 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,042 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-13 04:12:07,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:12:07,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:12:07,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:12:07,044 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:12:07,058 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,058 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,094 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:12:07,095 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,111 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,119 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:12:07,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:12:07,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:12:07,124 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:12:07,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (1/1) ... [2024-10-13 04:12:07,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:12:07,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:12:07,168 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-10-13 04:12:07,175 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-10-13 04:12:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:12:07,224 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:12:07,225 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:12:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:12:07,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:12:07,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:12:07,308 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:12:07,311 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:12:07,608 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:12:07,609 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:12:07,671 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:12:07,672 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:12:07,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:12:07 BoogieIcfgContainer [2024-10-13 04:12:07,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:12:07,674 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:12:07,674 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:12:07,677 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:12:07,678 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:12:06" (1/3) ... [2024-10-13 04:12:07,679 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab72d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:12:07, skipping insertion in model container [2024-10-13 04:12:07,679 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:06" (2/3) ... [2024-10-13 04:12:07,680 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab72d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:12:07, skipping insertion in model container [2024-10-13 04:12:07,680 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:12:07" (3/3) ... [2024-10-13 04:12:07,682 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-75.i [2024-10-13 04:12:07,695 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:12:07,695 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:12:07,751 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:12:07,757 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;@2e440dc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:12:07,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:12:07,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:12:07,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:12:07,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:12:07,772 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:12:07,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:12:07,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:12:07,779 INFO L85 PathProgramCache]: Analyzing trace with hash 1903834720, now seen corresponding path program 1 times [2024-10-13 04:12:07,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:12:07,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020048773] [2024-10-13 04:12:07,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:07,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:12:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:12:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-13 04:12:08,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 04:12:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-13 04:12:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-13 04:12:08,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-13 04:12:08,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-13 04:12:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-13 04:12:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-13 04:12:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-13 04:12:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-13 04:12:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-13 04:12:08,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-13 04:12:08,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-13 04:12:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,162 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:12:08,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:12:08,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020048773] [2024-10-13 04:12:08,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020048773] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:12:08,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:12:08,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:12:08,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104879810] [2024-10-13 04:12:08,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:12:08,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:12:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:12:08,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:12:08,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:12:08,210 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:12:08,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:12:08,260 INFO L93 Difference]: Finished difference Result 79 states and 131 transitions. [2024-10-13 04:12:08,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:12:08,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-13 04:12:08,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:12:08,278 INFO L225 Difference]: With dead ends: 79 [2024-10-13 04:12:08,278 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 04:12:08,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:12:08,287 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:12:08,289 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:12:08,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 04:12:08,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 04:12:08,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:12:08,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-13 04:12:08,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 88 [2024-10-13 04:12:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:12:08,341 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-13 04:12:08,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:12:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-13 04:12:08,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:12:08,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:12:08,345 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:12:08,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:12:08,346 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:12:08,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:12:08,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1920353448, now seen corresponding path program 1 times [2024-10-13 04:12:08,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:12:08,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29896731] [2024-10-13 04:12:08,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:08,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:12:08,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:12:08,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1451090259] [2024-10-13 04:12:08,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:08,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:12:08,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:12:08,484 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-10-13 04:12:08,485 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-10-13 04:12:08,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:08,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 04:12:08,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:12:08,880 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:12:08,880 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:12:08,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:12:08,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29896731] [2024-10-13 04:12:08,882 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-13 04:12:08,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1451090259] [2024-10-13 04:12:08,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1451090259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:12:08,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:12:08,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:12:08,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629813974] [2024-10-13 04:12:08,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:12:08,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:12:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:12:08,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:12:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:12:08,888 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:12:09,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:12:09,064 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2024-10-13 04:12:09,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:12:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-13 04:12:09,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:12:09,067 INFO L225 Difference]: With dead ends: 113 [2024-10-13 04:12:09,067 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 04:12:09,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:12:09,069 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:12:09,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 162 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:12:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 04:12:09,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2024-10-13 04:12:09,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:12:09,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-10-13 04:12:09,093 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 88 [2024-10-13 04:12:09,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:12:09,094 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-10-13 04:12:09,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:12:09,095 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-10-13 04:12:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:12:09,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:12:09,097 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:12:09,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 04:12:09,298 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-10-13 04:12:09,299 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:12:09,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:12:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash -599606486, now seen corresponding path program 1 times [2024-10-13 04:12:09,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:12:09,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085933115] [2024-10-13 04:12:09,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:09,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:12:09,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-13 04:12:09,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1811126494] [2024-10-13 04:12:09,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:09,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 04:12:09,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:12:09,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 04:12:09,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 04:12:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:12:09,606 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:12:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:12:09,742 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:12:09,742 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:12:09,744 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:12:09,765 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 04:12:09,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-10-13 04:12:09,950 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-13 04:12:10,019 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:12:10,022 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:12:10 BoogieIcfgContainer [2024-10-13 04:12:10,022 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:12:10,023 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:12:10,023 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:12:10,023 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:12:10,024 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:12:07" (3/4) ... [2024-10-13 04:12:10,026 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:12:10,028 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:12:10,029 INFO L158 Benchmark]: Toolchain (without parser) took 3401.99ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 144.7MB in the end (delta: 14.9MB). Peak memory consumption was 14.1MB. Max. memory is 16.1GB. [2024-10-13 04:12:10,030 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:12:10,030 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.61ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 145.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 04:12:10,031 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.90ms. Allocated memory is still 190.8MB. Free memory was 145.1MB in the beginning and 142.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:12:10,031 INFO L158 Benchmark]: Boogie Preprocessor took 79.20ms. Allocated memory is still 190.8MB. Free memory was 142.0MB in the beginning and 135.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:12:10,033 INFO L158 Benchmark]: RCFGBuilder took 548.49ms. Allocated memory is still 190.8MB. Free memory was 135.7MB in the beginning and 146.4MB in the end (delta: -10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-13 04:12:10,033 INFO L158 Benchmark]: TraceAbstraction took 2348.31ms. Allocated memory is still 190.8MB. Free memory was 145.3MB in the beginning and 144.7MB in the end (delta: 603.1kB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2024-10-13 04:12:10,033 INFO L158 Benchmark]: Witness Printer took 5.02ms. Allocated memory is still 190.8MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:12:10,038 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 79.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.61ms. Allocated memory is still 190.8MB. Free memory was 159.6MB in the beginning and 145.1MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.90ms. Allocated memory is still 190.8MB. Free memory was 145.1MB in the beginning and 142.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 79.20ms. Allocated memory is still 190.8MB. Free memory was 142.0MB in the beginning and 135.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 548.49ms. Allocated memory is still 190.8MB. Free memory was 135.7MB in the beginning and 146.4MB in the end (delta: -10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2348.31ms. Allocated memory is still 190.8MB. Free memory was 145.3MB in the beginning and 144.7MB in the end (delta: 603.1kB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Witness Printer took 5.02ms. Allocated memory is still 190.8MB. Free memory is still 144.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 85, overapproximation of someUnaryDOUBLEoperation at line 27, overapproximation of someBinaryDOUBLEComparisonOperation at line 85, overapproximation of someBinaryArithmeticFLOAToperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 32; [L23] unsigned char var_1_7 = 128; [L24] unsigned char var_1_8 = 64; [L25] unsigned char var_1_9 = 100; [L26] unsigned char var_1_10 = 1; [L27] float var_1_11 = -0.6; [L28] unsigned char var_1_12 = 1; [L29] double var_1_13 = 999999999999999.2; [L30] float var_1_14 = 50.25; [L31] float var_1_15 = 15.5; [L32] float var_1_16 = 128.5; [L33] unsigned char var_1_17 = 0; [L34] unsigned char last_1_var_1_17 = 0; [L89] isInitial = 1 [L90] FCALL initially() [L91] int k_loop; [L92] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=128, var_1_8=64, var_1_9=100] [L92] COND TRUE k_loop < 1 [L93] CALL updateLastVariables() [L82] last_1_var_1_17 = var_1_17 [L93] RET updateLastVariables() [L94] CALL updateVariables() [L57] var_1_7 = __VERIFIER_nondet_uchar() [L58] CALL assume_abort_if_not(var_1_7 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=64, var_1_9=100] [L58] RET assume_abort_if_not(var_1_7 >= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=64, var_1_9=100] [L59] CALL assume_abort_if_not(var_1_7 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=64, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=64, var_1_9=100] [L59] RET assume_abort_if_not(var_1_7 <= 254) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=64, var_1_9=100] [L60] var_1_8 = __VERIFIER_nondet_uchar() [L61] CALL assume_abort_if_not(var_1_8 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=100] [L61] RET assume_abort_if_not(var_1_8 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=100] [L62] CALL assume_abort_if_not(var_1_8 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=100] [L62] RET assume_abort_if_not(var_1_8 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=100] [L63] var_1_9 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_9 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L64] RET assume_abort_if_not(var_1_9 >= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L65] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L65] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=1, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L66] var_1_10 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L67] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_10 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L68] RET assume_abort_if_not(var_1_10 <= 63) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=1, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L69] var_1_12 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L70] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L71] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_13=4999999999999996/5, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L72] var_1_13 = __VERIFIER_nondet_double() [L73] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L73] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_14=201/4, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L74] var_1_14 = __VERIFIER_nondet_float() [L75] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L75] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_15=31/2, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L76] var_1_15 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L77] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_16=257/2, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L78] var_1_16 = __VERIFIER_nondet_float() [L79] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L79] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L94] RET updateVariables() [L95] CALL step() [L38] signed long int stepLocal_0 = (last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_0=0, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=32, var_1_7=383, var_1_8=63, var_1_9=127] [L39] COND FALSE !(stepLocal_0 < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) [L42] var_1_1 = var_1_8 VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=383, var_1_8=63, var_1_9=127] [L44] unsigned char stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_17=0, stepLocal_1=63, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=383, var_1_8=63, var_1_9=127] [L45] COND TRUE stepLocal_1 >= var_1_1 [L46] var_1_17 = (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_12=0, var_1_17=0, var_1_1=63, var_1_7=383, var_1_8=63, var_1_9=127] [L50] COND TRUE var_1_12 || ((var_1_13 * 49.25) == 32.8) [L51] var_1_11 = (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=0, var_1_1=63, var_1_7=383, var_1_8=63, var_1_9=127] [L95] RET step() [L96] CALL, EXPR property() [L85-L86] return (((((last_1_var_1_17 * last_1_var_1_17) * last_1_var_1_17) < ((((last_1_var_1_17) > (last_1_var_1_17)) ? (last_1_var_1_17) : (last_1_var_1_17)))) ? (var_1_1 == ((unsigned char) (var_1_7 - (((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))) - var_1_10)))) : (var_1_1 == ((unsigned char) var_1_8))) && ((var_1_12 || ((var_1_13 * 49.25) == 32.8)) ? (var_1_11 == ((float) (((((var_1_14 + var_1_15)) > (var_1_16)) ? ((var_1_14 + var_1_15)) : (var_1_16))))) : (var_1_11 == ((float) var_1_15)))) && ((var_1_1 >= var_1_1) ? (var_1_17 == ((unsigned char) (((((var_1_7) < 0 ) ? -(var_1_7) : (var_1_7))) - (((((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) < 0 ) ? -((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) : ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10)))))))) : (var_1_17 == ((unsigned char) var_1_8))) ; [L96] RET, EXPR property() [L96] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=0, var_1_1=63, var_1_7=383, var_1_8=63, var_1_9=127] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=0, var_1_10=-3265, var_1_11=2, var_1_12=0, var_1_16=0, var_1_17=0, var_1_1=63, var_1_7=383, var_1_8=63, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 213 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 114 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 99 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 133 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=2, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 340 SizeOfPredicates, 1 NumberOfNonLiveVariables, 206 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 728/728 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 04:12:10,068 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/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.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 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:12:12,257 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:12:12,335 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:12:12,342 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:12:12,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:12:12,386 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:12:12,386 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:12:12,387 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:12:12,387 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:12:12,387 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:12:12,388 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:12:12,388 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:12:12,391 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:12:12,395 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:12:12,396 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:12:12,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:12:12,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:12:12,396 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:12:12,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:12:12,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:12:12,397 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:12:12,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:12:12,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:12:12,398 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:12:12,400 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:12:12,401 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:12:12,401 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:12:12,401 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:12:12,401 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:12:12,402 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:12:12,402 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:12:12,402 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:12:12,402 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:12:12,402 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:12:12,403 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:12:12,403 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:12:12,404 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:12:12,404 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:12:12,404 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:12:12,405 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:12:12,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:12:12,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:12:12,406 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:12:12,406 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:12:12,406 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:12:12,407 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 -> 7b3ee70427eb3ed5b27bff5eeab913cae4038bd79b092738194dd7f928b44e69 [2024-10-13 04:12:12,773 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:12:12,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:12:12,800 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:12:12,802 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:12:12,802 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:12:12,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2024-10-13 04:12:14,492 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:12:14,706 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:12:14,707 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i [2024-10-13 04:12:14,720 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2989830/9e1c20d95cf0402c86a61c7e6354c046/FLAG882587c91 [2024-10-13 04:12:14,737 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f2989830/9e1c20d95cf0402c86a61c7e6354c046 [2024-10-13 04:12:14,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:12:14,742 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:12:14,744 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:12:14,744 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:12:14,750 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:12:14,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:12:14" (1/1) ... [2024-10-13 04:12:14,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d8fd566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:14, skipping insertion in model container [2024-10-13 04:12:14,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:12:14" (1/1) ... [2024-10-13 04:12:14,777 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:12:14,997 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2024-10-13 04:12:15,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:12:15,087 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:12:15,098 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-75.i[915,928] [2024-10-13 04:12:15,131 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:12:15,153 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:12:15,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15 WrapperNode [2024-10-13 04:12:15,154 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:12:15,155 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:12:15,156 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:12:15,156 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:12:15,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,216 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-10-13 04:12:15,217 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:12:15,217 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:12:15,221 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:12:15,221 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:12:15,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,241 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,260 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 04:12:15,261 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,261 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,268 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,271 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,273 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,278 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:12:15,287 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:12:15,287 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:12:15,287 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:12:15,288 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (1/1) ... [2024-10-13 04:12:15,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:12:15,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:12:15,324 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-10-13 04:12:15,328 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-10-13 04:12:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:12:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:12:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:12:15,379 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:12:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:12:15,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:12:15,452 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:12:15,456 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:12:16,808 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-13 04:12:16,809 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:12:16,867 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:12:16,867 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:12:16,868 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:12:16 BoogieIcfgContainer [2024-10-13 04:12:16,868 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:12:16,870 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:12:16,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:12:16,876 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:12:16,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:12:14" (1/3) ... [2024-10-13 04:12:16,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137e007b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:12:16, skipping insertion in model container [2024-10-13 04:12:16,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:12:15" (2/3) ... [2024-10-13 04:12:16,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@137e007b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:12:16, skipping insertion in model container [2024-10-13 04:12:16,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:12:16" (3/3) ... [2024-10-13 04:12:16,881 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-75.i [2024-10-13 04:12:16,899 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:12:16,899 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:12:16,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:12:16,980 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;@64d0a107, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:12:16,980 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:12:16,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:12:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:12:16,998 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:12:16,999 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:12:17,000 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:12:17,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:12:17,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1903834720, now seen corresponding path program 1 times [2024-10-13 04:12:17,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:12:17,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097859678] [2024-10-13 04:12:17,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:17,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:12:17,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:12:17,028 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-10-13 04:12:17,029 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-10-13 04:12:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:17,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:12:17,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:12:17,397 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 218 trivial. 0 not checked. [2024-10-13 04:12:17,398 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:12:17,399 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:12:17,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097859678] [2024-10-13 04:12:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1097859678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:12:17,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:12:17,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:12:17,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914834261] [2024-10-13 04:12:17,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:12:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:12:17,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:12:17,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:12:17,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:12:17,441 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 24 states have internal predecessors, (31), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:12:18,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:12:18,200 INFO L93 Difference]: Finished difference Result 79 states and 131 transitions. [2024-10-13 04:12:18,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:12:18,205 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-13 04:12:18,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:12:18,212 INFO L225 Difference]: With dead ends: 79 [2024-10-13 04:12:18,213 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 04:12:18,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:12:18,220 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:12:18,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 04:12:18,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 04:12:18,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 04:12:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 04:12:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-13 04:12:18,271 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 88 [2024-10-13 04:12:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:12:18,272 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-13 04:12:18,272 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 04:12:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-13 04:12:18,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:12:18,277 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:12:18,277 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:12:18,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-13 04:12:18,477 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-10-13 04:12:18,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:12:18,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:12:18,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1920353448, now seen corresponding path program 1 times [2024-10-13 04:12:18,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:12:18,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [664286682] [2024-10-13 04:12:18,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:18,482 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:12:18,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:12:18,484 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-10-13 04:12:18,502 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-10-13 04:12:18,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:18,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 04:12:18,747 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:12:19,112 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 04:12:19,114 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:12:19,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:12:19,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [664286682] [2024-10-13 04:12:19,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [664286682] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:12:19,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:12:19,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:12:19,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854270950] [2024-10-13 04:12:19,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:12:19,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:12:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:12:19,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:12:19,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:12:19,122 INFO L87 Difference]: Start difference. First operand 38 states and 54 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:12:20,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:12:20,288 INFO L93 Difference]: Finished difference Result 113 states and 161 transitions. [2024-10-13 04:12:20,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:12:20,289 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-13 04:12:20,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:12:20,291 INFO L225 Difference]: With dead ends: 113 [2024-10-13 04:12:20,291 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 04:12:20,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-13 04:12:20,293 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 26 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:12:20,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 162 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 04:12:20,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 04:12:20,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2024-10-13 04:12:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 04:12:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 96 transitions. [2024-10-13 04:12:20,314 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 96 transitions. Word has length 88 [2024-10-13 04:12:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:12:20,315 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 96 transitions. [2024-10-13 04:12:20,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 04:12:20,315 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 96 transitions. [2024-10-13 04:12:20,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-13 04:12:20,317 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:12:20,317 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 04:12:20,330 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-10-13 04:12:20,518 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-10-13 04:12:20,518 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:12:20,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:12:20,520 INFO L85 PathProgramCache]: Analyzing trace with hash -599606486, now seen corresponding path program 1 times [2024-10-13 04:12:20,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:12:20,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922515537] [2024-10-13 04:12:20,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:12:20,522 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 04:12:20,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:12:20,523 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-10-13 04:12:20,525 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-10-13 04:12:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:12:20,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 04:12:20,771 INFO L278 TraceCheckSpWp]: Computing forward predicates...