./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-60.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-60.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 aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:10:21,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:10:21,793 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 04:10:21,798 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:10:21,799 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:10:21,827 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:10:21,827 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:10:21,828 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:10:21,829 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:10:21,830 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:10:21,830 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:10:21,831 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:10:21,831 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:10:21,831 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:10:21,832 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:10:21,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:10:21,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:10:21,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:10:21,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 04:10:21,836 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:10:21,839 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:10:21,839 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:10:21,839 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:10:21,840 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:10:21,840 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:10:21,840 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:10:21,840 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:10:21,840 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:10:21,841 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:10:21,841 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:10:21,841 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:10:21,841 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:10:21,841 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:10:21,842 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:10:21,842 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:10:21,843 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:10:21,843 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 04:10:21,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 04:10:21,844 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:10:21,844 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:10:21,844 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:10:21,845 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:10:21,846 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 -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2024-10-13 04:10:22,122 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:10:22,147 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:10:22,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:10:22,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:10:22,153 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:10:22,154 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-13 04:10:23,617 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:10:23,812 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:10:23,813 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-13 04:10:23,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9486acd/8a547b1bbf2d454b87e6fd7c94a68395/FLAG293dddce3 [2024-10-13 04:10:24,195 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c9486acd/8a547b1bbf2d454b87e6fd7c94a68395 [2024-10-13 04:10:24,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:10:24,198 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:10:24,199 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:10:24,199 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:10:24,206 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:10:24,207 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,208 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46f4093d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24, skipping insertion in model container [2024-10-13 04:10:24,208 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:10:24,424 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-60.i[915,928] [2024-10-13 04:10:24,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:10:24,477 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:10:24,488 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-60.i[915,928] [2024-10-13 04:10:24,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:10:24,525 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:10:24,527 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24 WrapperNode [2024-10-13 04:10:24,527 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:10:24,528 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:10:24,529 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:10:24,529 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:10:24,537 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:10:24" (1/1) ... [2024-10-13 04:10:24,544 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:10:24" (1/1) ... [2024-10-13 04:10:24,566 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-13 04:10:24,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:10:24,567 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:10:24,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:10:24,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:10:24,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,596 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:10:24,600 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,601 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,610 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,615 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,617 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,618 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:10:24,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:10:24,622 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:10:24,622 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:10:24,623 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (1/1) ... [2024-10-13 04:10:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:10:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:10:24,676 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:10:24,680 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:10:24,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:10:24,812 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:10:24,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:10:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 04:10:24,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:10:24,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:10:24,897 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:10:24,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:10:25,092 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-13 04:10:25,092 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:10:25,134 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:10:25,134 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:10:25,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:10:25 BoogieIcfgContainer [2024-10-13 04:10:25,134 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:10:25,137 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:10:25,137 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:10:25,140 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:10:25,141 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:10:24" (1/3) ... [2024-10-13 04:10:25,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20eb1ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:10:25, skipping insertion in model container [2024-10-13 04:10:25,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:24" (2/3) ... [2024-10-13 04:10:25,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20eb1ce2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:10:25, skipping insertion in model container [2024-10-13 04:10:25,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:10:25" (3/3) ... [2024-10-13 04:10:25,145 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-13 04:10:25,164 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:10:25,165 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:10:25,231 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:10:25,237 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;@1f15e221, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:10:25,238 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:10:25,241 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 04:10:25,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 04:10:25,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:25,250 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:10:25,250 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:25,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1346839555, now seen corresponding path program 1 times [2024-10-13 04:10:25,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:10:25,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235810181] [2024-10-13 04:10:25,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:25,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:10:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:10:25,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:10:25,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:10:25,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:10:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 04:10:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 04:10:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,544 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:10:25,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:10:25,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235810181] [2024-10-13 04:10:25,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235810181] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:10:25,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:10:25,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:10:25,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907122597] [2024-10-13 04:10:25,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:10:25,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:10:25,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:10:25,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:10:25,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:10:25,582 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 04:10:25,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:10:25,630 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2024-10-13 04:10:25,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:10:25,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-10-13 04:10:25,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:10:25,640 INFO L225 Difference]: With dead ends: 62 [2024-10-13 04:10:25,640 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 04:10:25,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:10:25,648 INFO L432 NwaCegarLoop]: 35 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, 35 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:10:25,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:10:25,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 04:10:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 04:10:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 04:10:25,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-13 04:10:25,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2024-10-13 04:10:25,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:10:25,691 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-13 04:10:25,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 04:10:25,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-13 04:10:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 04:10:25,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:25,695 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:10:25,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 04:10:25,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:25,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:25,696 INFO L85 PathProgramCache]: Analyzing trace with hash -380037489, now seen corresponding path program 1 times [2024-10-13 04:10:25,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:10:25,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978910793] [2024-10-13 04:10:25,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:25,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:10:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:10:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:10:25,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:10:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:10:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 04:10:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 04:10:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:10:25,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:10:25,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978910793] [2024-10-13 04:10:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978910793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:10:25,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:10:25,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:10:25,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840959196] [2024-10-13 04:10:25,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:10:25,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:10:25,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:10:25,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:10:25,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:10:25,975 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:26,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:10:26,013 INFO L93 Difference]: Finished difference Result 57 states and 75 transitions. [2024-10-13 04:10:26,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:10:26,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-10-13 04:10:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:10:26,016 INFO L225 Difference]: With dead ends: 57 [2024-10-13 04:10:26,016 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 04:10:26,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:10:26,018 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 22 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:10:26,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:10:26,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 04:10:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 04:10:26,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 04:10:26,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2024-10-13 04:10:26,030 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 45 [2024-10-13 04:10:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:10:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2024-10-13 04:10:26,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:26,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2024-10-13 04:10:26,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 04:10:26,036 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:26,036 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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:10:26,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 04:10:26,037 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:26,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1906004842, now seen corresponding path program 1 times [2024-10-13 04:10:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:10:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036245394] [2024-10-13 04:10:26,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:10:26,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:10:26,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:10:26,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:10:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:10:26,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 04:10:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 04:10:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,194 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:10:26,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:10:26,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036245394] [2024-10-13 04:10:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036245394] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:10:26,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:10:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:10:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975581697] [2024-10-13 04:10:26,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:10:26,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:10:26,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:10:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:10:26,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:10:26,204 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:10:26,233 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2024-10-13 04:10:26,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:10:26,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-10-13 04:10:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:10:26,235 INFO L225 Difference]: With dead ends: 57 [2024-10-13 04:10:26,236 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 04:10:26,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:10:26,239 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 04:10:26,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 04:10:26,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 04:10:26,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 04:10:26,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 04:10:26,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2024-10-13 04:10:26,247 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 46 [2024-10-13 04:10:26,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:10:26,248 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2024-10-13 04:10:26,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:26,248 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2024-10-13 04:10:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 04:10:26,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:26,249 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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:10:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 04:10:26,250 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:26,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1905945260, now seen corresponding path program 1 times [2024-10-13 04:10:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:10:26,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831683611] [2024-10-13 04:10:26,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:10:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 04:10:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 04:10:26,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 04:10:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 04:10:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 04:10:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 04:10:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:26,505 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:10:26,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 04:10:26,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831683611] [2024-10-13 04:10:26,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831683611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:10:26,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:10:26,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:10:26,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448319375] [2024-10-13 04:10:26,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:10:26,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:10:26,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 04:10:26,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:10:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:10:26,510 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:26,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:10:26,608 INFO L93 Difference]: Finished difference Result 93 states and 114 transitions. [2024-10-13 04:10:26,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:10:26,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-10-13 04:10:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:10:26,611 INFO L225 Difference]: With dead ends: 93 [2024-10-13 04:10:26,612 INFO L226 Difference]: Without dead ends: 65 [2024-10-13 04:10:26,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:10:26,614 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:10:26,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 95 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 04:10:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-13 04:10:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2024-10-13 04:10:26,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 04:10:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 69 transitions. [2024-10-13 04:10:26,630 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 69 transitions. Word has length 46 [2024-10-13 04:10:26,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:10:26,630 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 69 transitions. [2024-10-13 04:10:26,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 69 transitions. [2024-10-13 04:10:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 04:10:26,632 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:26,632 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 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:10:26,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 04:10:26,633 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:26,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:26,633 INFO L85 PathProgramCache]: Analyzing trace with hash -1603953589, now seen corresponding path program 1 times [2024-10-13 04:10:26,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 04:10:26,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851733310] [2024-10-13 04:10:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 04:10:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:10:26,667 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 04:10:26,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 04:10:26,729 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 04:10:26,730 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 04:10:26,731 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 04:10:26,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 04:10:26,737 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-13 04:10:26,791 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 04:10:26,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 04:10:26 BoogieIcfgContainer [2024-10-13 04:10:26,795 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 04:10:26,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 04:10:26,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 04:10:26,796 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 04:10:26,796 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:10:25" (3/4) ... [2024-10-13 04:10:26,801 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 04:10:26,802 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 04:10:26,803 INFO L158 Benchmark]: Toolchain (without parser) took 2604.82ms. Allocated memory is still 165.7MB. Free memory was 114.5MB in the beginning and 99.4MB in the end (delta: 15.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2024-10-13 04:10:26,803 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:10:26,804 INFO L158 Benchmark]: CACSL2BoogieTranslator took 328.22ms. Allocated memory is still 165.7MB. Free memory was 114.0MB in the beginning and 100.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 04:10:26,804 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.37ms. Allocated memory is still 165.7MB. Free memory was 100.2MB in the beginning and 98.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:10:26,804 INFO L158 Benchmark]: Boogie Preprocessor took 53.37ms. Allocated memory is still 165.7MB. Free memory was 98.1MB in the beginning and 95.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 04:10:26,806 INFO L158 Benchmark]: RCFGBuilder took 513.00ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 122.9MB in the end (delta: -27.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-13 04:10:26,807 INFO L158 Benchmark]: TraceAbstraction took 1658.36ms. Allocated memory is still 165.7MB. Free memory was 121.8MB in the beginning and 99.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-10-13 04:10:26,807 INFO L158 Benchmark]: Witness Printer took 6.80ms. Allocated memory is still 165.7MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 04:10:26,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 65.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 328.22ms. Allocated memory is still 165.7MB. Free memory was 114.0MB in the beginning and 100.2MB in the end (delta: 13.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.37ms. Allocated memory is still 165.7MB. Free memory was 100.2MB in the beginning and 98.1MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.37ms. Allocated memory is still 165.7MB. Free memory was 98.1MB in the beginning and 95.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 513.00ms. Allocated memory is still 165.7MB. Free memory was 95.7MB in the beginning and 122.9MB in the end (delta: -27.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1658.36ms. Allocated memory is still 165.7MB. Free memory was 121.8MB in the beginning and 99.4MB in the end (delta: 22.4MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * Witness Printer took 6.80ms. Allocated memory is still 165.7MB. Free memory is still 99.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 78, overapproximation of someBinaryFLOATComparisonOperation at line 78, overapproximation of someBinaryArithmeticDOUBLEoperation at line 51. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 9999.6; [L23] double var_1_2 = 64.25; [L24] double var_1_3 = 31.2; [L25] signed long int var_1_4 = 1; [L26] float var_1_7 = 100.5; [L27] float var_1_9 = 50.2; [L28] float var_1_10 = 0.125; [L29] float var_1_11 = 9999999999999.8; [L30] float var_1_12 = 3.5; [L31] unsigned short int var_1_13 = 0; [L32] double last_1_var_1_1 = 9999.6; [L33] unsigned short int last_1_var_1_13 = 0; [L82] isInitial = 1 [L83] FCALL initially() [L84] int k_loop; [L85] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_2=257/4, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L85] COND TRUE k_loop < 1 [L86] CALL updateLastVariables() [L74] last_1_var_1_1 = var_1_1 [L75] last_1_var_1_13 = var_1_13 [L86] RET updateLastVariables() [L87] CALL updateVariables() [L60] var_1_2 = __VERIFIER_nondet_double() [L61] CALL assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L61] RET assume_abort_if_not((var_1_2 >= 0.0F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854765600e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_3=156/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L62] var_1_3 = __VERIFIER_nondet_double() [L63] CALL assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L63] RET assume_abort_if_not((var_1_3 >= 0.0F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854765600e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2, var_1_9=251/5] [L64] var_1_9 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L65] RET assume_abort_if_not((var_1_9 >= 0.0F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 4611686.018427382800e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_10=1/8, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L66] var_1_10 = __VERIFIER_nondet_float() [L67] CALL assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L67] RET assume_abort_if_not((var_1_10 >= 0.0F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 4611686.018427382800e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=49999999999999/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L68] var_1_11 = __VERIFIER_nondet_float() [L69] CALL assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L69] RET assume_abort_if_not((var_1_11 >= -461168.6018427382800e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 4611686.018427382800e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_12=7/2, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L70] var_1_12 = __VERIFIER_nondet_float() [L71] CALL assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L71] RET assume_abort_if_not((var_1_12 >= -461168.6018427382800e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 4611686.018427382800e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L87] RET updateVariables() [L88] CALL step() [L37] COND TRUE (- last_1_var_1_13) >= last_1_var_1_13 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L38] COND FALSE !(last_1_var_1_13 > last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L46] COND TRUE -4 < var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=0, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L47] COND TRUE var_1_11 <= (24.6f * var_1_9) [L48] var_1_13 = var_1_4 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_13=1, var_1_1=49998/5, var_1_4=1, var_1_7=201/2] [L51] var_1_1 = (var_1_2 - var_1_3) [L52] signed long int stepLocal_0 = var_1_13 + var_1_4; VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, stepLocal_0=2, var_1_13=1, var_1_4=1, var_1_7=201/2] [L53] COND FALSE !(stepLocal_0 < var_1_4) [L56] var_1_7 = var_1_11 VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L88] RET step() [L89] CALL, EXPR property() [L78-L79] return (((var_1_1 == ((double) (var_1_2 - var_1_3))) && (((- last_1_var_1_13) >= last_1_var_1_13) ? ((last_1_var_1_13 > last_1_var_1_13) ? ((var_1_3 == last_1_var_1_1) ? (var_1_4 == ((signed long int) last_1_var_1_13)) : (var_1_4 == ((signed long int) last_1_var_1_13))) : 1) : 1)) && (((var_1_13 + var_1_4) < var_1_4) ? (var_1_7 == ((float) (((((var_1_3 - (var_1_9 + var_1_10))) < ((var_1_11 + var_1_12))) ? ((var_1_3 - (var_1_9 + var_1_10))) : ((var_1_11 + var_1_12)))))) : (var_1_7 == ((float) var_1_11)))) && ((-4 < var_1_4) ? ((var_1_11 <= (24.6f * var_1_9)) ? (var_1_13 == ((unsigned short int) var_1_4)) : 1) : 1) ; [L89] RET, EXPR property() [L89] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, last_1_var_1_1=49998/5, var_1_11=10000000000004, var_1_13=1, var_1_4=1, var_1_7=10000000000004] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 58 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 58 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 129 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=4, InterpolantAutomatonStates: 12, 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, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 229 NumberOfCodeBlocks, 229 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 178 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 240/240 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:10:26,843 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-60.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 aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 04:10:29,086 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 04:10:29,175 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 04:10:29,180 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 04:10:29,181 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 04:10:29,213 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 04:10:29,214 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 04:10:29,215 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 04:10:29,216 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 04:10:29,217 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 04:10:29,217 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 04:10:29,217 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 04:10:29,218 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 04:10:29,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 04:10:29,220 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 04:10:29,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 04:10:29,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 04:10:29,221 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 04:10:29,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 04:10:29,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 04:10:29,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 04:10:29,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 04:10:29,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 04:10:29,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 04:10:29,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 04:10:29,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 04:10:29,228 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 04:10:29,228 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 04:10:29,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 04:10:29,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 04:10:29,229 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 04:10:29,229 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 04:10:29,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 04:10:29,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 04:10:29,230 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:10:29,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 04:10:29,230 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 04:10:29,230 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 04:10:29,231 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 04:10:29,231 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 04:10:29,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 04:10:29,232 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 04:10:29,232 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 04:10:29,232 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 04:10:29,232 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 04:10:29,233 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 -> aefb240a951bca0d323f7942f8cbc167b3249e539a62ebdfe910274215bcaca3 [2024-10-13 04:10:29,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 04:10:29,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 04:10:29,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 04:10:29,602 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 04:10:29,602 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 04:10:29,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-13 04:10:31,109 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 04:10:31,324 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 04:10:31,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-13 04:10:31,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0088fee/b2cbfc4850844f45bb372caf6c5f9e1d/FLAGbcff6a831 [2024-10-13 04:10:31,356 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c0088fee/b2cbfc4850844f45bb372caf6c5f9e1d [2024-10-13 04:10:31,359 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 04:10:31,360 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 04:10:31,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 04:10:31,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 04:10:31,369 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 04:10:31,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e473570 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31, skipping insertion in model container [2024-10-13 04:10:31,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,405 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 04:10:31,590 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-60.i[915,928] [2024-10-13 04:10:31,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:10:31,663 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 04:10:31,677 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-60.i[915,928] [2024-10-13 04:10:31,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 04:10:31,727 INFO L204 MainTranslator]: Completed translation [2024-10-13 04:10:31,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31 WrapperNode [2024-10-13 04:10:31,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 04:10:31,730 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 04:10:31,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 04:10:31,731 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 04:10:31,737 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:10:31" (1/1) ... [2024-10-13 04:10:31,752 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:10:31" (1/1) ... [2024-10-13 04:10:31,785 INFO L138 Inliner]: procedures = 27, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 90 [2024-10-13 04:10:31,786 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 04:10:31,787 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 04:10:31,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 04:10:31,789 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 04:10:31,801 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,801 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,806 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,836 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:10:31,837 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,837 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,850 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,853 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,857 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,861 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 04:10:31,868 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 04:10:31,868 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 04:10:31,868 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 04:10:31,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (1/1) ... [2024-10-13 04:10:31,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 04:10:31,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 04:10:31,904 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:10:31,910 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:10:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 04:10:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 04:10:31,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 04:10:31,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 04:10:31,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 04:10:31,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 04:10:32,031 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 04:10:32,033 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 04:10:40,995 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-13 04:10:40,995 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 04:10:41,040 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 04:10:41,040 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 04:10:41,041 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:10:41 BoogieIcfgContainer [2024-10-13 04:10:41,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 04:10:41,047 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 04:10:41,047 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 04:10:41,052 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 04:10:41,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 04:10:31" (1/3) ... [2024-10-13 04:10:41,053 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272f2c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:10:41, skipping insertion in model container [2024-10-13 04:10:41,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 04:10:31" (2/3) ... [2024-10-13 04:10:41,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@272f2c7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 04:10:41, skipping insertion in model container [2024-10-13 04:10:41,055 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 04:10:41" (3/3) ... [2024-10-13 04:10:41,056 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-60.i [2024-10-13 04:10:41,073 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 04:10:41,074 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 04:10:41,155 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 04:10:41,163 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;@6c544b00, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 04:10:41,164 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 04:10:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 04:10:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 04:10:41,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:41,179 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:10:41,180 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:41,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1346839555, now seen corresponding path program 1 times [2024-10-13 04:10:41,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:10:41,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892723606] [2024-10-13 04:10:41,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:41,202 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:10:41,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:10:41,206 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:10:41,207 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:10:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:41,571 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 04:10:41,577 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:10:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 04:10:41,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:10:41,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:10:41,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892723606] [2024-10-13 04:10:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892723606] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:10:41,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:10:41,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:10:41,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57927696] [2024-10-13 04:10:41,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:10:41,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 04:10:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:10:41,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 04:10:41,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 04:10:41,650 INFO L87 Difference]: Start difference. First operand has 32 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 24 states have internal predecessors, (34), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 04:10:45,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:10:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:10:45,885 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2024-10-13 04:10:45,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 04:10:45,887 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 45 [2024-10-13 04:10:45,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:10:45,892 INFO L225 Difference]: With dead ends: 62 [2024-10-13 04:10:45,892 INFO L226 Difference]: Without dead ends: 29 [2024-10-13 04:10:45,894 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:10:45,897 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-13 04:10:45,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.2s Time] [2024-10-13 04:10:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-13 04:10:45,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-10-13 04:10:45,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-13 04:10:45,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 38 transitions. [2024-10-13 04:10:45,934 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 38 transitions. Word has length 45 [2024-10-13 04:10:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:10:45,935 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 38 transitions. [2024-10-13 04:10:45,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-13 04:10:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 38 transitions. [2024-10-13 04:10:45,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-13 04:10:45,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:10:45,937 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 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:10:45,952 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:10:46,141 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:10:46,142 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:10:46,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:10:46,143 INFO L85 PathProgramCache]: Analyzing trace with hash -380037489, now seen corresponding path program 1 times [2024-10-13 04:10:46,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:10:46,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730140681] [2024-10-13 04:10:46,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:10:46,144 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:10:46,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:10:46,148 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:10:46,149 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:10:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:10:46,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 04:10:46,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:10:47,076 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:10:47,076 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:10:47,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:10:47,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730140681] [2024-10-13 04:10:47,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730140681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:10:47,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:10:47,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 04:10:47,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325451600] [2024-10-13 04:10:47,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:10:47,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 04:10:47,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:10:47,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 04:10:47,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 04:10:47,080 INFO L87 Difference]: Start difference. First operand 29 states and 38 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:10:51,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:10:55,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:10:59,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:03,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:07,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:11,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:11,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:11:11,834 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2024-10-13 04:11:11,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 04:11:11,834 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2024-10-13 04:11:11,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:11:11,837 INFO L225 Difference]: With dead ends: 95 [2024-10-13 04:11:11,837 INFO L226 Difference]: Without dead ends: 67 [2024-10-13 04:11:11,838 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:11:11,843 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 14 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.7s IncrementalHoareTripleChecker+Time [2024-10-13 04:11:11,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 14 Invalid, 6 Unknown, 0 Unchecked, 24.7s Time] [2024-10-13 04:11:11,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-13 04:11:11,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2024-10-13 04:11:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 04:11:11,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 73 transitions. [2024-10-13 04:11:11,869 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 73 transitions. Word has length 45 [2024-10-13 04:11:11,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:11:11,869 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 73 transitions. [2024-10-13 04:11:11,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:11:11,870 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2024-10-13 04:11:11,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-13 04:11:11,871 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:11:11,871 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 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:11:11,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-13 04:11:12,072 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:11:12,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:11:12,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:11:12,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1985008824, now seen corresponding path program 1 times [2024-10-13 04:11:12,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:11:12,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670663709] [2024-10-13 04:11:12,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:11:12,074 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:11:12,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:11:12,078 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:11:12,079 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:11:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:11:12,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 04:11:12,390 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:11:12,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:11:12,877 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:11:12,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:11:12,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1670663709] [2024-10-13 04:11:12,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1670663709] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:11:12,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:11:12,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 04:11:12,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145593404] [2024-10-13 04:11:12,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:11:12,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 04:11:12,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:11:12,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 04:11:12,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:11:12,880 INFO L87 Difference]: Start difference. First operand 55 states and 73 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:11:15,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:19,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:19,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:11:19,302 INFO L93 Difference]: Finished difference Result 109 states and 145 transitions. [2024-10-13 04:11:19,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 04:11:19,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 46 [2024-10-13 04:11:19,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:11:19,304 INFO L225 Difference]: With dead ends: 109 [2024-10-13 04:11:19,304 INFO L226 Difference]: Without dead ends: 55 [2024-10-13 04:11:19,305 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 04:11:19,306 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2024-10-13 04:11:19,306 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 28 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 1 Unknown, 0 Unchecked, 6.4s Time] [2024-10-13 04:11:19,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-13 04:11:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-13 04:11:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 04:11:19,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2024-10-13 04:11:19,323 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 46 [2024-10-13 04:11:19,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:11:19,324 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2024-10-13 04:11:19,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:11:19,324 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2024-10-13 04:11:19,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 04:11:19,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:11:19,328 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 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:11:19,341 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 (4)] Ended with exit code 0 [2024-10-13 04:11:19,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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:11:19,529 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:11:19,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:11:19,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1604013171, now seen corresponding path program 1 times [2024-10-13 04:11:19,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:11:19,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [435873772] [2024-10-13 04:11:19,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:11:19,530 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:11:19,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:11:19,534 INFO L229 MonitoredProcess]: Starting monitored process 5 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:11:19,535 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 (5)] Waiting until timeout for monitored process [2024-10-13 04:11:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:11:19,847 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-13 04:11:19,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 04:11:20,481 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2024-10-13 04:11:20,481 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 04:11:20,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 04:11:20,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [435873772] [2024-10-13 04:11:20,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [435873772] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 04:11:20,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 04:11:20,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 04:11:20,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271183385] [2024-10-13 04:11:20,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 04:11:20,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 04:11:20,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 04:11:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 04:11:20,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 04:11:20,485 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:11:25,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:27,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:31,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:35,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:39,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:43,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:47,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 04:11:47,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 04:11:47,669 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2024-10-13 04:11:47,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 04:11:47,676 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 47 [2024-10-13 04:11:47,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 04:11:47,677 INFO L225 Difference]: With dead ends: 85 [2024-10-13 04:11:47,677 INFO L226 Difference]: Without dead ends: 57 [2024-10-13 04:11:47,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-10-13 04:11:47,679 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 50 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.1s IncrementalHoareTripleChecker+Time [2024-10-13 04:11:47,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 93 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 5 Unknown, 0 Unchecked, 27.1s Time] [2024-10-13 04:11:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-13 04:11:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2024-10-13 04:11:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 40 states have (on average 1.15) internal successors, (46), 40 states have internal predecessors, (46), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-13 04:11:47,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2024-10-13 04:11:47,691 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 47 [2024-10-13 04:11:47,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 04:11:47,691 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2024-10-13 04:11:47,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-10-13 04:11:47,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2024-10-13 04:11:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-13 04:11:47,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 04:11:47,698 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 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:11:47,716 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 (5)] Ended with exit code 0 [2024-10-13 04:11:47,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:11:47,899 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 04:11:47,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 04:11:47,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1603953589, now seen corresponding path program 1 times [2024-10-13 04:11:47,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 04:11:47,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1935015164] [2024-10-13 04:11:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 04:11:47,900 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:11:47,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 04:11:47,902 INFO L229 MonitoredProcess]: Starting monitored process 6 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:11:47,903 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 (6)] Waiting until timeout for monitored process [2024-10-13 04:11:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 04:11:48,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-13 04:11:48,237 INFO L278 TraceCheckSpWp]: Computing forward predicates...