./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-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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-73.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 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:30:25,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:30:25,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:30:25,505 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:30:25,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:30:25,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:30:25,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:30:25,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:30:25,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:30:25,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:30:25,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:30:25,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:30:25,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:30:25,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:30:25,541 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:30:25,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:30:25,542 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:30:25,545 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:30:25,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:30:25,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:30:25,546 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:30:25,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:30:25,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:30:25,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:30:25,548 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:30:25,548 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:30:25,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:30:25,549 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:30:25,550 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:30:25,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:30:25,550 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:30:25,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:30:25,551 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:30:25,551 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:30:25,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:30:25,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:30:25,553 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:30:25,553 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:30:25,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:30:25,553 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:30:25,553 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:30:25,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:30:25,554 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 -> 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 [2024-10-24 09:30:25,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:30:25,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:30:25,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:30:25,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:30:25,828 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:30:25,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-10-24 09:30:27,351 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:30:27,551 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:30:27,552 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-10-24 09:30:27,560 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b206d6d/1657a67159084143b3c5610dd5de64f7/FLAGb9c230201 [2024-10-24 09:30:27,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c3b206d6d/1657a67159084143b3c5610dd5de64f7 [2024-10-24 09:30:27,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:30:27,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:30:27,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:30:27,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:30:27,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:30:27,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:27,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35caf320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27, skipping insertion in model container [2024-10-24 09:30:27,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:27,612 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:30:27,796 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-73.i[915,928] [2024-10-24 09:30:27,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:30:27,857 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:30:27,872 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-73.i[915,928] [2024-10-24 09:30:27,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:30:27,916 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:30:27,916 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27 WrapperNode [2024-10-24 09:30:27,917 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:30:27,918 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:30:27,919 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:30:27,919 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:30:27,926 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:27,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:27,983 INFO L138 Inliner]: procedures = 26, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-24 09:30:27,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:30:27,988 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:30:27,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:30:27,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:30:27,999 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:27,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,025 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-24 09:30:28,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,036 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,040 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,044 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,047 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:30:28,052 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:30:28,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:30:28,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:30:28,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (1/1) ... [2024-10-24 09:30:28,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:30:28,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:30:28,095 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-24 09:30:28,099 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-24 09:30:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:30:28,138 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:30:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:30:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:30:28,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:30:28,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:30:28,203 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:30:28,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:30:28,427 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:30:28,428 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:30:28,496 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:30:28,496 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:30:28,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:30:28 BoogieIcfgContainer [2024-10-24 09:30:28,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:30:28,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:30:28,503 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:30:28,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:30:28,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:30:27" (1/3) ... [2024-10-24 09:30:28,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b00ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:30:28, skipping insertion in model container [2024-10-24 09:30:28,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:27" (2/3) ... [2024-10-24 09:30:28,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b00ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:30:28, skipping insertion in model container [2024-10-24 09:30:28,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:30:28" (3/3) ... [2024-10-24 09:30:28,512 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-10-24 09:30:28,531 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:30:28,532 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:30:28,591 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:30:28,598 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;@17faa40b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:30:28,598 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:30:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 09:30:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 09:30:28,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:28,610 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:28,610 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:28,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:28,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1149708957, now seen corresponding path program 1 times [2024-10-24 09:30:28,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:30:28,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987343840] [2024-10-24 09:30:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:28,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:30:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:30:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:30:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:30:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:30:28,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:30:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:30:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:30:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:30:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:30:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 09:30:28,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:30:28,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987343840] [2024-10-24 09:30:28,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987343840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:28,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:28,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:30:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400997419] [2024-10-24 09:30:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:28,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:30:28,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:30:28,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:30:28,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:30:28,964 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 09:30:28,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:28,996 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2024-10-24 09:30:28,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:30:28,999 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2024-10-24 09:30:28,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:29,004 INFO L225 Difference]: With dead ends: 63 [2024-10-24 09:30:29,004 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 09:30:29,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 29 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-24 09:30:29,010 INFO L432 NwaCegarLoop]: 40 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, 40 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-24 09:30:29,010 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:30:29,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 09:30:29,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-24 09:30:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 09:30:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2024-10-24 09:30:29,048 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 58 [2024-10-24 09:30:29,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:29,049 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2024-10-24 09:30:29,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 09:30:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2024-10-24 09:30:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 09:30:29,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:29,056 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:29,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:30:29,057 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:29,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:29,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1440460059, now seen corresponding path program 1 times [2024-10-24 09:30:29,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:30:29,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364311103] [2024-10-24 09:30:29,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:29,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:30:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:30:29,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:30:29,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:30:29,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:30:29,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:30:29,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:30:29,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:30:29,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:30:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:30:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,569 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 09:30:29,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:30:29,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364311103] [2024-10-24 09:30:29,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364311103] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:29,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:29,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 09:30:29,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550675098] [2024-10-24 09:30:29,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:29,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:30:29,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:30:29,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:30:29,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:30:29,580 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:29,748 INFO L93 Difference]: Finished difference Result 89 states and 128 transitions. [2024-10-24 09:30:29,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:30:29,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2024-10-24 09:30:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:29,751 INFO L225 Difference]: With dead ends: 89 [2024-10-24 09:30:29,751 INFO L226 Difference]: Without dead ends: 60 [2024-10-24 09:30:29,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:30:29,754 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 36 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:30:29,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 130 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:30:29,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-24 09:30:29,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 50. [2024-10-24 09:30:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 09:30:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-10-24 09:30:29,774 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 58 [2024-10-24 09:30:29,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:29,775 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-10-24 09:30:29,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:29,775 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-10-24 09:30:29,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 09:30:29,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:29,777 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:29,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:30:29,777 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:29,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:29,778 INFO L85 PathProgramCache]: Analyzing trace with hash -484216350, now seen corresponding path program 1 times [2024-10-24 09:30:29,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:30:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520811763] [2024-10-24 09:30:29,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:30:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:30:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:30:29,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:30:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:30:29,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 09:30:29,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 09:30:29,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 09:30:29,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 09:30:29,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 09:30:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:29,882 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 09:30:29,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:30:29,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520811763] [2024-10-24 09:30:29,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520811763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:29,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:29,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:30:29,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57895042] [2024-10-24 09:30:29,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:29,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:30:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:30:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:30:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:30:29,886 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:29,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:29,926 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2024-10-24 09:30:29,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:30:29,927 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2024-10-24 09:30:29,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:29,929 INFO L225 Difference]: With dead ends: 87 [2024-10-24 09:30:29,929 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 09:30:29,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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-24 09:30:29,930 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:30:29,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 75 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:30:29,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 09:30:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-10-24 09:30:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 09:30:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-24 09:30:29,941 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 59 [2024-10-24 09:30:29,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:29,942 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-24 09:30:29,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:29,942 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-24 09:30:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 09:30:29,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:29,944 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:30:29,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -426958048, now seen corresponding path program 1 times [2024-10-24 09:30:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:30:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167714289] [2024-10-24 09:30:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:30:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:30:29,994 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:30:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:30:30,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:30:30,047 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:30:30,048 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:30:30,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:30:30,053 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 09:30:30,126 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:30:30,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:30:30 BoogieIcfgContainer [2024-10-24 09:30:30,133 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:30:30,134 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:30:30,134 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:30:30,134 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:30:30,135 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:30:28" (3/4) ... [2024-10-24 09:30:30,137 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:30:30,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:30:30,140 INFO L158 Benchmark]: Toolchain (without parser) took 2563.29ms. Allocated memory is still 184.5MB. Free memory was 126.1MB in the beginning and 63.3MB in the end (delta: 62.8MB). Peak memory consumption was 63.8MB. Max. memory is 16.1GB. [2024-10-24 09:30:30,141 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:30:30,141 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.31ms. Allocated memory is still 184.5MB. Free memory was 125.7MB in the beginning and 112.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 09:30:30,144 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.82ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 109.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 09:30:30,144 INFO L158 Benchmark]: Boogie Preprocessor took 63.80ms. Allocated memory is still 184.5MB. Free memory was 109.3MB in the beginning and 105.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:30:30,145 INFO L158 Benchmark]: RCFGBuilder took 444.66ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 86.2MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:30:30,145 INFO L158 Benchmark]: TraceAbstraction took 1630.50ms. Allocated memory is still 184.5MB. Free memory was 85.8MB in the beginning and 63.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. [2024-10-24 09:30:30,145 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 184.5MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:30:30,146 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.18ms. Allocated memory is still 184.5MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.31ms. Allocated memory is still 184.5MB. Free memory was 125.7MB in the beginning and 112.2MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.82ms. Allocated memory is still 184.5MB. Free memory was 112.2MB in the beginning and 109.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.80ms. Allocated memory is still 184.5MB. Free memory was 109.3MB in the beginning and 105.8MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 444.66ms. Allocated memory is still 184.5MB. Free memory was 105.8MB in the beginning and 86.2MB in the end (delta: 19.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1630.50ms. Allocated memory is still 184.5MB. Free memory was 85.8MB in the beginning and 63.3MB in the end (delta: 22.5MB). Peak memory consumption was 21.9MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 184.5MB. Free memory is still 63.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] unsigned char var_1_12 = 10; [L29] signed short int var_1_13 = -64; [L30] signed long int var_1_14 = 10; [L31] signed short int var_1_15 = -1; [L32] unsigned char last_1_var_1_8 = 25; [L33] signed long int last_1_var_1_14 = 10; [L85] isInitial = 1 [L86] FCALL initially() [L87] int k_loop; [L88] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L88] COND TRUE k_loop < 1 [L89] CALL updateLastVariables() [L77] last_1_var_1_8 = var_1_8 [L78] last_1_var_1_14 = var_1_14 [L89] RET updateLastVariables() [L90] CALL updateVariables() [L61] var_1_6 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L62] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_8=25, var_1_9=100] [L63] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L63] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L64] var_1_7 = __VERIFIER_nondet_double() [L65] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L65] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L66] var_1_9 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L67] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25] [L68] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L68] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=1, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L69] var_1_10 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L70] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L71] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L71] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=10, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L72] var_1_12 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L73] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L74] CALL assume_abort_if_not(var_1_12 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L74] RET assume_abort_if_not(var_1_12 <= 254) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L90] RET updateVariables() [L91] CALL step() [L37] signed long int stepLocal_0 = (((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))); VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, stepLocal_0=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L38] COND TRUE last_1_var_1_14 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=8] [L39] COND FALSE !(! var_1_6) [L42] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=25, var_1_9=8] [L45] COND TRUE \read(var_1_6) [L46] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=-64, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] [L52] COND TRUE (9.99999999999995E13f + var_1_1) >= var_1_1 [L53] var_1_13 = (-4 + var_1_10) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=1, var_1_14=10, var_1_15=-1, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] [L57] var_1_15 = var_1_12 [L58] var_1_14 = var_1_15 [L91] RET step() [L92] CALL, EXPR property() [L81-L82] return (((((last_1_var_1_14 <= ((((last_1_var_1_8) > ((last_1_var_1_14 + last_1_var_1_14))) ? (last_1_var_1_8) : ((last_1_var_1_14 + last_1_var_1_14))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((var_1_1 < (var_1_1 + var_1_7)) ? (var_1_8 == ((unsigned char) var_1_12)) : 1))) && (((9.99999999999995E13f + var_1_1) >= var_1_1) ? (var_1_13 == ((signed short int) (-4 + var_1_10))) : (var_1_13 == ((signed short int) (((((var_1_9) < (8)) ? (var_1_9) : (8))) - 32))))) && (var_1_14 == ((signed long int) var_1_15))) && (var_1_15 == ((signed short int) var_1_12)) ; [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=1, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=10, last_1_var_1_8=25, var_1_10=5, var_1_12=254, var_1_13=1, var_1_14=254, var_1_15=254, var_1_1=259, var_1_6=1, var_1_7=259, var_1_8=8, var_1_9=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 46 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 245 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 125 mSDsCounter, 29 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 61 IncrementalHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 29 mSolverCounterUnsat, 120 mSDtfsCounter, 61 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=3, InterpolantAutomatonStates: 10, 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, 3 MinimizatonAttempts, 17 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 172 ConstructedInterpolants, 0 QuantifiedInterpolants, 228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 432/432 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-24 09:30:30,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/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-73.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 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:30:32,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:30:32,475 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:30:32,480 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:30:32,480 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:30:32,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:30:32,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:30:32,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:30:32,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:30:32,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:30:32,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:30:32,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:30:32,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:30:32,523 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:30:32,524 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:30:32,524 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:30:32,525 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:30:32,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:30:32,525 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:30:32,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:30:32,526 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:30:32,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:30:32,530 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:30:32,530 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:30:32,530 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:30:32,531 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:30:32,531 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:30:32,531 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:30:32,531 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:30:32,532 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:30:32,532 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:30:32,532 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:30:32,532 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:30:32,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:30:32,533 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:30:32,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:30:32,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:30:32,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:30:32,536 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:30:32,536 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:30:32,536 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:30:32,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:30:32,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:30:32,537 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:30:32,537 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:30:32,537 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 -> 8e493bb9dfb1e4026bad014b506150c14522bad4ce88bea6356ffab3296ecf60 [2024-10-24 09:30:32,846 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:30:32,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:30:32,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:30:32,875 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:30:32,875 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:30:32,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-10-24 09:30:34,273 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:30:34,474 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:30:34,475 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-10-24 09:30:34,483 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8816264f/86f57030651e47caaa4fe84e298a2bc5/FLAG848c08adb [2024-10-24 09:30:34,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8816264f/86f57030651e47caaa4fe84e298a2bc5 [2024-10-24 09:30:34,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:30:34,840 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:30:34,841 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:30:34,841 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:30:34,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:30:34,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:30:34" (1/1) ... [2024-10-24 09:30:34,848 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c88940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:34, skipping insertion in model container [2024-10-24 09:30:34,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:30:34" (1/1) ... [2024-10-24 09:30:34,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:30:35,057 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-73.i[915,928] [2024-10-24 09:30:35,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:30:35,124 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:30:35,139 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-73.i[915,928] [2024-10-24 09:30:35,159 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:30:35,186 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:30:35,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35 WrapperNode [2024-10-24 09:30:35,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:30:35,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:30:35,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:30:35,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:30:35,195 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,209 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,236 INFO L138 Inliner]: procedures = 27, calls = 22, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2024-10-24 09:30:35,239 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:30:35,240 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:30:35,241 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:30:35,241 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:30:35,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,276 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-24 09:30:35,280 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,294 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,297 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,309 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:30:35,310 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:30:35,311 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:30:35,311 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:30:35,311 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (1/1) ... [2024-10-24 09:30:35,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:30:35,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:30:35,349 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-24 09:30:35,352 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-24 09:30:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:30:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:30:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:30:35,409 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:30:35,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:30:35,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:30:35,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:30:35,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:30:36,423 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-24 09:30:36,423 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:30:36,496 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:30:36,497 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:30:36,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:30:36 BoogieIcfgContainer [2024-10-24 09:30:36,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:30:36,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:30:36,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:30:36,504 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:30:36,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:30:34" (1/3) ... [2024-10-24 09:30:36,506 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14065ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:30:36, skipping insertion in model container [2024-10-24 09:30:36,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:30:35" (2/3) ... [2024-10-24 09:30:36,507 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14065ea5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:30:36, skipping insertion in model container [2024-10-24 09:30:36,507 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:30:36" (3/3) ... [2024-10-24 09:30:36,508 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-73.i [2024-10-24 09:30:36,524 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:30:36,525 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:30:36,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:30:36,603 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;@1e18e756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:30:36,604 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:30:36,607 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 09:30:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 09:30:36,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:36,616 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:36,616 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:36,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:36,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1149708957, now seen corresponding path program 1 times [2024-10-24 09:30:36,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:30:36,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425528193] [2024-10-24 09:30:36,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:36,632 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-24 09:30:36,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:30:36,635 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-24 09:30:36,636 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-24 09:30:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:36,873 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:30:36,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:30:36,912 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2024-10-24 09:30:36,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:30:36,916 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:30:36,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425528193] [2024-10-24 09:30:36,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425528193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:36,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:36,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:30:36,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972818921] [2024-10-24 09:30:36,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:36,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:30:36,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:30:36,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:30:36,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:30:36,949 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 09:30:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:37,345 INFO L93 Difference]: Finished difference Result 63 states and 104 transitions. [2024-10-24 09:30:37,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:30:37,348 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) Word has length 58 [2024-10-24 09:30:37,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:37,353 INFO L225 Difference]: With dead ends: 63 [2024-10-24 09:30:37,353 INFO L226 Difference]: Without dead ends: 30 [2024-10-24 09:30:37,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 57 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-24 09:30:37,359 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 40 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.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:30:37,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 40 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:30:37,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-24 09:30:37,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-24 09:30:37,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 states have internal predecessors, (25), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-24 09:30:37,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 43 transitions. [2024-10-24 09:30:37,387 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 43 transitions. Word has length 58 [2024-10-24 09:30:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:37,388 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 43 transitions. [2024-10-24 09:30:37,388 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, (9), 2 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 2 states have call successors, (9) [2024-10-24 09:30:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 43 transitions. [2024-10-24 09:30:37,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-10-24 09:30:37,397 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:37,397 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:37,405 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-24 09:30:37,598 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-24 09:30:37,598 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:37,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:37,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1440460059, now seen corresponding path program 1 times [2024-10-24 09:30:37,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:30:37,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [960735306] [2024-10-24 09:30:37,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:37,601 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-24 09:30:37,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:30:37,606 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-24 09:30:37,607 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-24 09:30:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:37,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:30:37,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:30:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 09:30:38,352 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:30:38,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:30:38,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [960735306] [2024-10-24 09:30:38,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [960735306] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:38,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:38,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:30:38,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904835416] [2024-10-24 09:30:38,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:38,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 09:30:38,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:30:38,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 09:30:38,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:30:38,358 INFO L87 Difference]: Start difference. First operand 30 states and 43 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:39,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:39,567 INFO L93 Difference]: Finished difference Result 91 states and 131 transitions. [2024-10-24 09:30:39,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:30:39,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 58 [2024-10-24 09:30:39,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:39,570 INFO L225 Difference]: With dead ends: 91 [2024-10-24 09:30:39,570 INFO L226 Difference]: Without dead ends: 62 [2024-10-24 09:30:39,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:30:39,572 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-24 09:30:39,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 132 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-24 09:30:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-24 09:30:39,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 50. [2024-10-24 09:30:39,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 09:30:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-10-24 09:30:39,594 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 58 [2024-10-24 09:30:39,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:39,594 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-10-24 09:30:39,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:39,595 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-10-24 09:30:39,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 09:30:39,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:39,596 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:39,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:30:39,797 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-24 09:30:39,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:39,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:39,798 INFO L85 PathProgramCache]: Analyzing trace with hash -484216350, now seen corresponding path program 1 times [2024-10-24 09:30:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:30:39,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388938198] [2024-10-24 09:30:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:39,799 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-24 09:30:39,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:30:39,802 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-24 09:30:39,803 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-24 09:30:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:40,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:30:40,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:30:40,032 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-10-24 09:30:40,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:30:40,033 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:30:40,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388938198] [2024-10-24 09:30:40,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388938198] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:30:40,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:30:40,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:30:40,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782293813] [2024-10-24 09:30:40,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:30:40,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:30:40,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:30:40,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:30:40,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:30:40,036 INFO L87 Difference]: Start difference. First operand 50 states and 71 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:30:40,678 INFO L93 Difference]: Finished difference Result 87 states and 123 transitions. [2024-10-24 09:30:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:30:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 59 [2024-10-24 09:30:40,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:30:40,680 INFO L225 Difference]: With dead ends: 87 [2024-10-24 09:30:40,680 INFO L226 Difference]: Without dead ends: 58 [2024-10-24 09:30:40,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-24 09:30:40,681 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:30:40,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 74 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 09:30:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-24 09:30:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2024-10-24 09:30:40,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-10-24 09:30:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 72 transitions. [2024-10-24 09:30:40,701 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 72 transitions. Word has length 59 [2024-10-24 09:30:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:30:40,702 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 72 transitions. [2024-10-24 09:30:40,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2024-10-24 09:30:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 72 transitions. [2024-10-24 09:30:40,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-24 09:30:40,706 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:30:40,706 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 09:30:40,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 (4)] Ended with exit code 0 [2024-10-24 09:30:40,910 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-24 09:30:40,911 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:30:40,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:30:40,916 INFO L85 PathProgramCache]: Analyzing trace with hash -426958048, now seen corresponding path program 1 times [2024-10-24 09:30:40,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:30:40,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2109700666] [2024-10-24 09:30:40,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:30:40,916 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-24 09:30:40,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:30:40,920 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-24 09:30:40,921 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-24 09:30:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:30:41,107 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 09:30:41,111 INFO L278 TraceCheckSpWp]: Computing forward predicates...