./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.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 d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:30:17,707 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:30:17,794 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:30:17,799 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:30:17,801 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:30:17,831 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:30:17,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:30:17,832 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:30:17,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:30:17,835 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:30:17,835 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:30:17,835 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:30:17,836 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:30:17,836 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:30:17,836 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:30:17,838 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:30:17,838 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:30:17,839 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:30:17,839 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:30:17,839 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:30:17,840 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:30:17,840 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:30:17,841 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:30:17,841 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:30:17,841 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:30:17,841 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:30:17,842 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:30:17,842 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:30:17,842 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:30:17,843 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:30:17,843 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:30:17,843 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:30:17,844 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:30:17,844 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:30:17,844 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:30:17,845 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:30:17,845 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:30:17,845 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:30:17,845 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:30:17,846 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:30:17,846 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:30:17,847 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:30:17,847 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 -> d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 [2024-11-16 12:30:18,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:30:18,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:30:18,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:30:18,152 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:30:18,153 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:30:18,155 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2024-11-16 12:30:19,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:30:19,876 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:30:19,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2024-11-16 12:30:19,886 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2633828/3621205abf344d1d8eca99efc456c2b1/FLAGc09fae321 [2024-11-16 12:30:19,900 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c2633828/3621205abf344d1d8eca99efc456c2b1 [2024-11-16 12:30:19,904 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:30:19,905 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:30:19,906 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:30:19,906 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:30:19,912 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:30:19,913 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:19" (1/1) ... [2024-11-16 12:30:19,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d5dd53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:19, skipping insertion in model container [2024-11-16 12:30:19,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:30:19" (1/1) ... [2024-11-16 12:30:19,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:30:20,137 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i[917,930] [2024-11-16 12:30:20,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:30:20,234 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:30:20,245 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i[917,930] [2024-11-16 12:30:20,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:30:20,302 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:30:20,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20 WrapperNode [2024-11-16 12:30:20,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:30:20,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:30:20,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:30:20,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:30:20,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,321 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,360 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 142 [2024-11-16 12:30:20,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:30:20,361 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:30:20,362 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:30:20,362 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:30:20,378 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,400 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:30:20,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,420 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,422 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,429 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,443 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:30:20,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:30:20,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:30:20,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:30:20,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (1/1) ... [2024-11-16 12:30:20,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:30:20,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:30:20,481 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:30:20,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:30:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:30:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:30:20,525 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:30:20,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:30:20,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:30:20,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:30:20,592 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:30:20,594 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:30:20,928 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L118: havoc property_#t~bitwise13#1; [2024-11-16 12:30:20,969 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 12:30:20,969 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:30:21,006 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:30:21,007 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:30:21,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:30:21 BoogieIcfgContainer [2024-11-16 12:30:21,007 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:30:21,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:30:21,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:30:21,014 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:30:21,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:30:19" (1/3) ... [2024-11-16 12:30:21,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513a8b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:21, skipping insertion in model container [2024-11-16 12:30:21,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:30:20" (2/3) ... [2024-11-16 12:30:21,015 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513a8b72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:30:21, skipping insertion in model container [2024-11-16 12:30:21,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:30:21" (3/3) ... [2024-11-16 12:30:21,017 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-68.i [2024-11-16 12:30:21,034 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:30:21,035 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:30:21,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:30:21,110 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;@2f983588, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:30:21,110 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:30:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:30:21,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 12:30:21,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:30:21,126 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:30:21,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:30:21,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:30:21,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1124177242, now seen corresponding path program 1 times [2024-11-16 12:30:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:30:21,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359832094] [2024-11-16 12:30:21,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:21,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:30:21,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:30:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:30:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:30:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:30:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:30:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:30:21,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:30:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:30:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:30:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:30:21,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:30:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:30:21,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:30:21,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:30:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:30:21,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:30:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:21,523 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:30:21,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:30:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359832094] [2024-11-16 12:30:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359832094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:30:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:30:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:30:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141329917] [2024-11-16 12:30:21,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:30:21,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:30:21,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:30:21,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:30:21,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:30:21,567 INFO L87 Difference]: Start difference. First operand has 70 states, 51 states have (on average 1.411764705882353) internal successors, (72), 52 states have internal predecessors, (72), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 12:30:21,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:30:21,612 INFO L93 Difference]: Finished difference Result 132 states and 217 transitions. [2024-11-16 12:30:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:30:21,615 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 113 [2024-11-16 12:30:21,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:30:21,625 INFO L225 Difference]: With dead ends: 132 [2024-11-16 12:30:21,625 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 12:30:21,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:30:21,635 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:30:21,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:30:21,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 12:30:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-16 12:30:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:30:21,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 96 transitions. [2024-11-16 12:30:21,677 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 96 transitions. Word has length 113 [2024-11-16 12:30:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:30:21,677 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 96 transitions. [2024-11-16 12:30:21,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.0) internal successors, (36), 2 states have internal predecessors, (36), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 12:30:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 96 transitions. [2024-11-16 12:30:21,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-16 12:30:21,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:30:21,683 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:30:21,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:30:21,683 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:30:21,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:30:21,684 INFO L85 PathProgramCache]: Analyzing trace with hash -308412680, now seen corresponding path program 1 times [2024-11-16 12:30:21,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:30:21,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60016405] [2024-11-16 12:30:21,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:21,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:30:21,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:30:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:30:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:30:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:30:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:30:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:30:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:30:22,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:30:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:30:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:30:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:30:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:30:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:30:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:30:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:30:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:30:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:30:22,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:30:22,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60016405] [2024-11-16 12:30:22,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60016405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:30:22,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:30:22,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:30:22,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106221267] [2024-11-16 12:30:22,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:30:22,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:30:22,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:30:22,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:30:22,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:30:22,104 INFO L87 Difference]: Start difference. First operand 65 states and 96 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:30:22,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:30:22,173 INFO L93 Difference]: Finished difference Result 127 states and 189 transitions. [2024-11-16 12:30:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:30:22,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 113 [2024-11-16 12:30:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:30:22,179 INFO L225 Difference]: With dead ends: 127 [2024-11-16 12:30:22,180 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 12:30:22,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-11-16 12:30:22,183 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:30:22,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 164 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:30:22,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 12:30:22,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-16 12:30:22,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:30:22,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 95 transitions. [2024-11-16 12:30:22,198 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 95 transitions. Word has length 113 [2024-11-16 12:30:22,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:30:22,201 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 95 transitions. [2024-11-16 12:30:22,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:30:22,201 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 95 transitions. [2024-11-16 12:30:22,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 12:30:22,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:30:22,203 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:30:22,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:30:22,204 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:30:22,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:30:22,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1223155716, now seen corresponding path program 1 times [2024-11-16 12:30:22,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:30:22,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625323171] [2024-11-16 12:30:22,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:22,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:30:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:30:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:30:22,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:30:22,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:30:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:30:22,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:30:22,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:30:22,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:30:22,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:30:22,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:30:22,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:30:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:30:22,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:30:22,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:30:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:30:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:30:22,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:22,931 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:30:22,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:30:22,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625323171] [2024-11-16 12:30:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625323171] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:30:22,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:30:22,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 12:30:22,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452313106] [2024-11-16 12:30:22,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:30:22,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 12:30:22,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:30:22,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 12:30:22,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 12:30:22,937 INFO L87 Difference]: Start difference. First operand 65 states and 95 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:30:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:30:23,239 INFO L93 Difference]: Finished difference Result 189 states and 272 transitions. [2024-11-16 12:30:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:30:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 114 [2024-11-16 12:30:23,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:30:23,244 INFO L225 Difference]: With dead ends: 189 [2024-11-16 12:30:23,244 INFO L226 Difference]: Without dead ends: 127 [2024-11-16 12:30:23,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:30:23,246 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 188 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:30:23,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 180 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:30:23,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-16 12:30:23,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 71. [2024-11-16 12:30:23,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:30:23,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2024-11-16 12:30:23,269 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 114 [2024-11-16 12:30:23,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:30:23,269 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2024-11-16 12:30:23,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:30:23,270 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2024-11-16 12:30:23,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-16 12:30:23,271 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:30:23,272 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:30:23,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:30:23,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:30:23,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:30:23,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1516558723, now seen corresponding path program 1 times [2024-11-16 12:30:23,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:30:23,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398576110] [2024-11-16 12:30:23,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:23,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:30:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:30:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:30:23,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:30:23,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:30:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 12:30:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:30:23,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 12:30:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:30:23,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 12:30:23,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:30:23,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:30:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 12:30:23,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-16 12:30:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 12:30:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:30:23,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-16 12:30:23,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,617 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-16 12:30:23,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:30:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398576110] [2024-11-16 12:30:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398576110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:30:23,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1558990580] [2024-11-16 12:30:23,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:23,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:30:23,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:30:23,622 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:30:23,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:30:23,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:23,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 12:30:23,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:30:23,942 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-16 12:30:23,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:30:24,173 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-16 12:30:24,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1558990580] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:30:24,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:30:24,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-16 12:30:24,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197912122] [2024-11-16 12:30:24,177 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:30:24,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:30:24,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:30:24,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:30:24,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:30:24,181 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 12:30:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:30:24,357 INFO L93 Difference]: Finished difference Result 145 states and 201 transitions. [2024-11-16 12:30:24,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:30:24,358 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 114 [2024-11-16 12:30:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:30:24,359 INFO L225 Difference]: With dead ends: 145 [2024-11-16 12:30:24,359 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 12:30:24,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:30:24,361 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 141 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:30:24,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 171 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:30:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 12:30:24,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2024-11-16 12:30:24,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 53 states have internal predecessors, (67), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:30:24,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 99 transitions. [2024-11-16 12:30:24,370 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 99 transitions. Word has length 114 [2024-11-16 12:30:24,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:30:24,371 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 99 transitions. [2024-11-16 12:30:24,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 12:30:24,371 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 99 transitions. [2024-11-16 12:30:24,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 12:30:24,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:30:24,373 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:30:24,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:30:24,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:30:24,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:30:24,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:30:24,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1218043127, now seen corresponding path program 1 times [2024-11-16 12:30:24,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:30:24,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961330176] [2024-11-16 12:30:24,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:24,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:30:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:30:24,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [713275910] [2024-11-16 12:30:24,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:30:24,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:30:24,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:30:24,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:30:24,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:30:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:30:24,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 12:30:24,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:30:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 319 proven. 30 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-16 12:30:25,209 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:31:00,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:31:00,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961330176] [2024-11-16 12:31:00,475 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 12:31:00,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713275910] [2024-11-16 12:31:00,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713275910] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:31:00,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 12:31:00,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-16 12:31:00,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748992827] [2024-11-16 12:31:00,478 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 12:31:00,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:31:00,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:31:00,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:31:00,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=208, Unknown=8, NotChecked=0, Total=272 [2024-11-16 12:31:00,480 INFO L87 Difference]: Start difference. First operand 73 states and 99 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-16 12:31:02,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:31:02,862 INFO L93 Difference]: Finished difference Result 183 states and 244 transitions. [2024-11-16 12:31:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 12:31:02,863 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 115 [2024-11-16 12:31:02,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:31:02,864 INFO L225 Difference]: With dead ends: 183 [2024-11-16 12:31:02,865 INFO L226 Difference]: Without dead ends: 113 [2024-11-16 12:31:02,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=105, Invalid=393, Unknown=8, NotChecked=0, Total=506 [2024-11-16 12:31:02,866 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 141 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 12:31:02,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 275 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 12:31:02,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-16 12:31:02,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2024-11-16 12:31:02,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.25) internal successors, (75), 60 states have internal predecessors, (75), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:31:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 107 transitions. [2024-11-16 12:31:02,877 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 107 transitions. Word has length 115 [2024-11-16 12:31:02,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:31:02,877 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 107 transitions. [2024-11-16 12:31:02,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 12 states have internal predecessors, (50), 3 states have call successors, (16), 3 states have call predecessors, (16), 5 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2024-11-16 12:31:02,878 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 107 transitions. [2024-11-16 12:31:02,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-16 12:31:02,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:31:02,880 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:31:02,889 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 12:31:03,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:31:03,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:31:03,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:31:03,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1723614472, now seen corresponding path program 1 times [2024-11-16 12:31:03,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:31:03,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562641543] [2024-11-16 12:31:03,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:31:03,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:31:03,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:31:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [336942706] [2024-11-16 12:31:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:31:03,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:31:03,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:31:03,137 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:31:03,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 12:31:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:31:03,230 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:31:03,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:31:03,330 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:31:03,331 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:31:03,332 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:31:03,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-16 12:31:03,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:31:03,537 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 12:31:03,610 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:31:03,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:31:03 BoogieIcfgContainer [2024-11-16 12:31:03,614 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:31:03,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:31:03,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:31:03,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:31:03,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:30:21" (3/4) ... [2024-11-16 12:31:03,617 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:31:03,619 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:31:03,619 INFO L158 Benchmark]: Toolchain (without parser) took 43714.07ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 120.7MB in the beginning and 81.9MB in the end (delta: 38.9MB). Peak memory consumption was 88.3MB. Max. memory is 16.1GB. [2024-11-16 12:31:03,619 INFO L158 Benchmark]: CDTParser took 0.56ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:31:03,620 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.38ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 140.1MB in the end (delta: -19.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 12:31:03,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 136.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:31:03,620 INFO L158 Benchmark]: Boogie Preprocessor took 82.33ms. Allocated memory is still 176.2MB. Free memory was 136.0MB in the beginning and 131.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 12:31:03,620 INFO L158 Benchmark]: IcfgBuilder took 562.93ms. Allocated memory is still 176.2MB. Free memory was 131.6MB in the beginning and 106.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 12:31:03,621 INFO L158 Benchmark]: TraceAbstraction took 42604.10ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 106.2MB in the beginning and 82.9MB in the end (delta: 23.2MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. [2024-11-16 12:31:03,621 INFO L158 Benchmark]: Witness Printer took 4.53ms. Allocated memory is still 226.5MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:31:03,623 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.56ms. Allocated memory is still 100.7MB. Free memory is still 55.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 397.38ms. Allocated memory is still 176.2MB. Free memory was 120.3MB in the beginning and 140.1MB in the end (delta: -19.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory is still 176.2MB. Free memory was 140.1MB in the beginning and 136.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.33ms. Allocated memory is still 176.2MB. Free memory was 136.0MB in the beginning and 131.6MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 562.93ms. Allocated memory is still 176.2MB. Free memory was 131.6MB in the beginning and 106.6MB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42604.10ms. Allocated memory was 176.2MB in the beginning and 226.5MB in the end (delta: 50.3MB). Free memory was 106.2MB in the beginning and 82.9MB in the end (delta: 23.2MB). Peak memory consumption was 76.7MB. Max. memory is 16.1GB. * Witness Printer took 4.53ms. Allocated memory is still 226.5MB. Free memory was 82.9MB in the beginning and 81.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryFLOATComparisonOperation at line 118. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_2 = 10; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 16; [L26] unsigned char var_1_5 = 0; [L27] unsigned char var_1_6 = 0; [L28] unsigned char var_1_7 = 1; [L29] unsigned char var_1_8 = 32; [L30] double var_1_9 = 4.6; [L31] double var_1_10 = 9.25; [L32] double var_1_11 = 1.25; [L33] unsigned char var_1_12 = 100; [L34] unsigned char var_1_13 = 64; [L35] unsigned char var_1_14 = 0; [L36] float var_1_15 = 7.5; [L37] signed long int var_1_16 = 0; VAL [isInitial=0, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=10, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L122] isInitial = 1 [L123] FCALL initially() [L124] COND TRUE 1 [L125] FCALL updateLastVariables() [L126] CALL updateVariables() [L90] var_1_2 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L91] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L92] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_3=25, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L93] var_1_3 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L94] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] CALL assume_abort_if_not(var_1_3 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L95] RET assume_abort_if_not(var_1_3 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_4=16, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L96] var_1_4 = __VERIFIER_nondet_uchar() [L97] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L97] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] CALL assume_abort_if_not(var_1_4 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L98] RET assume_abort_if_not(var_1_4 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L99] var_1_5 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L100] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L101] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L101] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L102] var_1_7 = __VERIFIER_nondet_uchar() [L103] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L103] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L104] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L104] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=32, var_1_9=23/5] [L105] var_1_8 = __VERIFIER_nondet_uchar() [L106] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L106] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L107] CALL assume_abort_if_not(var_1_8 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L107] RET assume_abort_if_not(var_1_8 <= 255) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_9=23/5] [L108] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L108] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=37/4, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L109] var_1_10 = __VERIFIER_nondet_double() [L110] CALL assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L110] RET assume_abort_if_not((var_1_10 >= -922337.2036854765600e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854765600e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=64, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L111] var_1_13 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L112] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L113] CALL assume_abort_if_not(var_1_13 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L113] RET assume_abort_if_not(var_1_13 <= 254) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L126] RET updateVariables() [L127] CALL step() [L41] unsigned char stepLocal_0 = var_1_2; VAL [isInitial=1, stepLocal_0=2, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L42] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, stepLocal_0=2, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L42] COND FALSE !(stepLocal_0 <= (var_1_3 ^ var_1_4)) [L45] var_1_1 = (! var_1_5) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L47] unsigned char stepLocal_2 = (var_1_5 && var_1_7) && var_1_1; [L48] signed long int stepLocal_1 = -256; VAL [isInitial=1, stepLocal_1=-256, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L49] COND FALSE !(stepLocal_1 >= var_1_3) VAL [isInitial=1, stepLocal_2=0, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L52] COND FALSE !((var_1_2 < (var_1_4 / var_1_8)) || stepLocal_2) VAL [isInitial=1, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=23/5] [L56] COND TRUE ((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8) [L57] var_1_9 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L59] unsigned char stepLocal_3 = var_1_7 && var_1_1; VAL [isInitial=1, stepLocal_3=1, var_1_10=2, var_1_11=5/4, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L60] COND TRUE stepLocal_3 || (! var_1_5) [L61] var_1_11 = var_1_10 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L63] unsigned char stepLocal_4 = var_1_3; VAL [isInitial=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L64] COND TRUE \read(var_1_1) VAL [isInitial=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=100, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L65] COND FALSE !(var_1_10 >= (- var_1_9)) [L72] var_1_12 = var_1_13 VAL [isInitial=1, stepLocal_4=0, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L77] unsigned char stepLocal_6 = var_1_2; [L78] signed long int stepLocal_5 = var_1_13 + 16; VAL [isInitial=1, stepLocal_4=0, stepLocal_5=19, stepLocal_6=2, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L79] COND FALSE !((var_1_13 % (5u + 256u)) <= stepLocal_6) VAL [isInitial=1, stepLocal_4=0, stepLocal_5=19, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=15/2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L86] var_1_15 = var_1_10 [L87] var_1_16 = var_1_3 VAL [isInitial=1, stepLocal_4=0, stepLocal_5=19, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L127] RET step() [L128] CALL, EXPR property() [L118] EXPR var_1_3 ^ var_1_4 VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L118-L119] return ((((((((var_1_2 <= (var_1_3 ^ var_1_4)) ? (var_1_1 == ((unsigned char) (! var_1_5))) : (var_1_1 == ((unsigned char) (! var_1_5)))) && ((-256 >= var_1_3) ? (var_1_6 == ((unsigned char) (var_1_1 || var_1_7))) : (((var_1_2 < (var_1_4 / var_1_8)) || ((var_1_5 && var_1_7) && var_1_1)) ? (var_1_6 == ((unsigned char) var_1_7)) : 1))) && ((((((((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) > (var_1_4)) ? (((((var_1_2) < (var_1_3)) ? (var_1_2) : (var_1_3)))) : (var_1_4))) <= (50 * var_1_8)) ? (var_1_9 == ((double) var_1_10)) : 1)) && (((var_1_7 && var_1_1) || (! var_1_5)) ? (var_1_11 == ((double) var_1_10)) : 1)) && (var_1_1 ? ((var_1_10 >= (- var_1_9)) ? ((var_1_8 != var_1_3) ? (var_1_12 == ((unsigned char) var_1_13)) : (var_1_12 == ((unsigned char) 50))) : (var_1_12 == ((unsigned char) var_1_13))) : (var_1_12 == ((unsigned char) var_1_13)))) && (((var_1_13 % (5u + 256u)) <= var_1_2) ? (((var_1_13 + 16) >= var_1_2) ? (var_1_14 == ((unsigned char) var_1_7)) : (var_1_14 == ((unsigned char) var_1_7))) : 1)) && (var_1_15 == ((float) var_1_10))) && (var_1_16 == ((signed long int) var_1_3)) ; [L128] RET, EXPR property() [L128] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] [L19] reach_error() VAL [isInitial=1, var_1_10=2, var_1_11=2, var_1_12=3, var_1_13=3, var_1_14=0, var_1_15=2, var_1_16=0, var_1_1=1, var_1_2=2, var_1_3=0, var_1_4=1, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=1, var_1_9=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.5s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 482 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 470 mSDsluCounter, 884 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 468 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 416 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 538 GetRequests, 501 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 35.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=5, InterpolantAutomatonStates: 37, 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, 5 MinimizatonAttempts, 92 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 37.6s InterpolantComputationTime, 1028 NumberOfCodeBlocks, 1028 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 790 ConstructedInterpolants, 0 QuantifiedInterpolants, 1763 SizeOfPredicates, 8 NumberOfNonLiveVariables, 542 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 3258/3360 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 12:31:03,834 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-16 12:31:03,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.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 d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:31:06,007 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:31:06,092 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:31:06,099 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:31:06,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:31:06,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:31:06,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:31:06,134 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:31:06,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:31:06,136 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:31:06,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:31:06,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:31:06,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:31:06,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:31:06,140 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:31:06,141 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:31:06,141 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:31:06,141 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:31:06,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:31:06,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:31:06,142 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:31:06,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:31:06,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:31:06,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:31:06,146 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:31:06,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:31:06,146 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:31:06,147 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:31:06,147 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:31:06,147 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:31:06,147 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:31:06,148 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:31:06,148 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:31:06,148 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:31:06,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:31:06,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:31:06,149 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:31:06,149 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:31:06,149 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:31:06,149 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:31:06,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:31:06,150 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:31:06,150 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:31:06,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:31:06,150 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 -> d848ed00fc0d485481470376dd76caee8f421720e20ea964be77cc23ea1203a7 [2024-11-16 12:31:06,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:31:06,504 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:31:06,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:31:06,509 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:31:06,509 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:31:06,510 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2024-11-16 12:31:08,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:31:08,377 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:31:08,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i [2024-11-16 12:31:08,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09133ae7/c0ab178cf5cd4c838919062075796cb0/FLAG393a90486 [2024-11-16 12:31:08,735 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a09133ae7/c0ab178cf5cd4c838919062075796cb0 [2024-11-16 12:31:08,738 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:31:08,739 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:31:08,740 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:31:08,741 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:31:08,747 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:31:08,750 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:08" (1/1) ... [2024-11-16 12:31:08,751 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@107a05a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:08, skipping insertion in model container [2024-11-16 12:31:08,751 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:31:08" (1/1) ... [2024-11-16 12:31:08,781 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:31:08,980 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i[917,930] [2024-11-16 12:31:09,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:31:09,083 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:31:09,095 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-68.i[917,930] [2024-11-16 12:31:09,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:31:09,158 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:31:09,159 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09 WrapperNode [2024-11-16 12:31:09,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:31:09,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:31:09,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:31:09,161 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:31:09,168 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,181 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,218 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-11-16 12:31:09,219 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:31:09,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:31:09,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:31:09,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:31:09,242 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,242 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,247 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,272 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 12:31:09,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,294 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,295 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,297 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,306 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:31:09,307 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:31:09,308 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:31:09,308 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:31:09,314 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (1/1) ... [2024-11-16 12:31:09,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:31:09,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:31:09,359 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 12:31:09,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 12:31:09,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:31:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:31:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:31:09,418 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:31:09,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:31:09,420 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:31:09,519 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:31:09,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:31:10,056 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2024-11-16 12:31:10,057 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:31:10,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:31:10,073 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:31:10,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:31:10 BoogieIcfgContainer [2024-11-16 12:31:10,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:31:10,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:31:10,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:31:10,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:31:10,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:31:08" (1/3) ... [2024-11-16 12:31:10,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab5b05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:31:10, skipping insertion in model container [2024-11-16 12:31:10,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:31:09" (2/3) ... [2024-11-16 12:31:10,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ab5b05e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:31:10, skipping insertion in model container [2024-11-16 12:31:10,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:31:10" (3/3) ... [2024-11-16 12:31:10,084 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-68.i [2024-11-16 12:31:10,109 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:31:10,110 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:31:10,174 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:31:10,185 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;@3e0b2bc2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:31:10,185 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:31:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:31:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:31:10,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:31:10,206 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:31:10,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:31:10,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:31:10,214 INFO L85 PathProgramCache]: Analyzing trace with hash -648858019, now seen corresponding path program 1 times [2024-11-16 12:31:10,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:31:10,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934090656] [2024-11-16 12:31:10,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:31:10,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:31:10,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:31:10,236 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:31:10,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:31:10,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:31:10,456 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:31:10,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:31:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2024-11-16 12:31:10,516 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:31:10,516 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:31:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934090656] [2024-11-16 12:31:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934090656] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:31:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:31:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:31:10,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277859621] [2024-11-16 12:31:10,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:31:10,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:31:10,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:31:10,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:31:10,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:31:10,552 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 43 states have internal predecessors, (57), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 12:31:10,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:31:10,600 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2024-11-16 12:31:10,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:31:10,604 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2024-11-16 12:31:10,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:31:10,614 INFO L225 Difference]: With dead ends: 114 [2024-11-16 12:31:10,614 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 12:31:10,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:31:10,622 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:31:10,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:31:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 12:31:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 12:31:10,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:31:10,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2024-11-16 12:31:10,662 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 110 [2024-11-16 12:31:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:31:10,662 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2024-11-16 12:31:10,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-16 12:31:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2024-11-16 12:31:10,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:31:10,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:31:10,665 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:31:10,671 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-11-16 12:31:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:31:10,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:31:10,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:31:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1980604033, now seen corresponding path program 1 times [2024-11-16 12:31:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:31:10,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160815670] [2024-11-16 12:31:10,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:31:10,869 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:31:10,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:31:10,872 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:31:10,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:31:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:31:11,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 12:31:11,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:31:11,134 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-16 12:31:11,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:31:11,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:31:11,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160815670] [2024-11-16 12:31:11,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160815670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:31:11,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:31:11,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:31:11,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949320655] [2024-11-16 12:31:11,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:31:11,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:31:11,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:31:11,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:31:11,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:31:11,143 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:31:11,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:31:11,307 INFO L93 Difference]: Finished difference Result 109 states and 159 transitions. [2024-11-16 12:31:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:31:11,315 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 110 [2024-11-16 12:31:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:31:11,317 INFO L225 Difference]: With dead ends: 109 [2024-11-16 12:31:11,317 INFO L226 Difference]: Without dead ends: 56 [2024-11-16 12:31:11,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 108 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-11-16 12:31:11,319 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:31:11,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:31:11,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-16 12:31:11,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-16 12:31:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:31:11,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-16 12:31:11,335 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 110 [2024-11-16 12:31:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:31:11,336 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-16 12:31:11,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-16 12:31:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-16 12:31:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:31:11,339 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:31:11,339 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:31:11,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 12:31:11,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:31:11,540 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:31:11,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:31:11,541 INFO L85 PathProgramCache]: Analyzing trace with hash 92637549, now seen corresponding path program 1 times [2024-11-16 12:31:11,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:31:11,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [160559852] [2024-11-16 12:31:11,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:31:11,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:31:11,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:31:11,545 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:31:11,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 12:31:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:31:11,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 12:31:11,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:31:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2024-11-16 12:31:12,041 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:31:12,367 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-16 12:31:12,367 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:31:12,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [160559852] [2024-11-16 12:31:12,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [160559852] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:31:12,368 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:31:12,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2024-11-16 12:31:12,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298720094] [2024-11-16 12:31:12,368 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:31:12,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:31:12,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:31:12,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:31:12,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:31:12,372 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 12:31:13,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:31:13,111 INFO L93 Difference]: Finished difference Result 117 states and 164 transitions. [2024-11-16 12:31:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 12:31:13,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 111 [2024-11-16 12:31:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:31:13,126 INFO L225 Difference]: With dead ends: 117 [2024-11-16 12:31:13,126 INFO L226 Difference]: Without dead ends: 64 [2024-11-16 12:31:13,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 213 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:31:13,128 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 159 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:31:13,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 126 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:31:13,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-16 12:31:13,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2024-11-16 12:31:13,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 41 states have internal predecessors, (49), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-16 12:31:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 81 transitions. [2024-11-16 12:31:13,140 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 81 transitions. Word has length 111 [2024-11-16 12:31:13,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:31:13,141 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 81 transitions. [2024-11-16 12:31:13,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.777777777777778) internal successors, (52), 9 states have internal predecessors, (52), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-16 12:31:13,141 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 81 transitions. [2024-11-16 12:31:13,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-16 12:31:13,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:31:13,143 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:31:13,152 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-11-16 12:31:13,347 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-11-16 12:31:13,348 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:31:13,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:31:13,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1718718338, now seen corresponding path program 1 times [2024-11-16 12:31:13,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:31:13,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [164890286] [2024-11-16 12:31:13,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:31:13,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:31:13,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:31:13,353 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-11-16 12:31:13,356 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-11-16 12:31:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:31:13,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-16 12:31:13,518 INFO L278 TraceCheckSpWp]: Computing forward predicates...