./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.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 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:43:22,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:43:23,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 23:43:23,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:43:23,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:43:23,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:43:23,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:43:23,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:43:23,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:43:23,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:43:23,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:43:23,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:43:23,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:43:23,056 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:43:23,057 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:43:23,057 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:43:23,057 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:43:23,057 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:43:23,057 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 23:43:23,058 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:43:23,058 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:43:23,060 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:43:23,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:43:23,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:43:23,061 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:43:23,061 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:43:23,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:43:23,061 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:43:23,062 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:43:23,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:43:23,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:43:23,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:43:23,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:23,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:43:23,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:43:23,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:43:23,064 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 23:43:23,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 23:43:23,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:43:23,065 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:43:23,065 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:43:23,065 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:43:23,065 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 -> 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 [2024-11-08 23:43:23,257 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:43:23,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:43:23,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:43:23,294 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:43:23,294 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:43:23,296 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-11-08 23:43:24,601 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:43:24,757 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:43:24,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-11-08 23:43:24,766 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3e45928/709ac2804ecc40b7ae01d1fb8fea21ae/FLAG2e50713fb [2024-11-08 23:43:24,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a3e45928/709ac2804ecc40b7ae01d1fb8fea21ae [2024-11-08 23:43:24,778 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:43:24,779 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:43:24,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:24,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:43:24,785 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:43:24,785 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:43:24" (1/1) ... [2024-11-08 23:43:24,786 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42f4e01c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:24, skipping insertion in model container [2024-11-08 23:43:24,786 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:43:24" (1/1) ... [2024-11-08 23:43:24,804 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:43:24,948 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i[915,928] [2024-11-08 23:43:24,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:24,986 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:43:24,996 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i[915,928] [2024-11-08 23:43:25,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:25,025 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:43:25,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25 WrapperNode [2024-11-08 23:43:25,026 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:25,027 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:25,027 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:43:25,027 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:43:25,032 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,066 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-11-08 23:43:25,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:25,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:43:25,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:43:25,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:43:25,076 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,077 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,091 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-08 23:43:25,091 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,091 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,102 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,105 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:43:25,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:43:25,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:43:25,112 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:43:25,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (1/1) ... [2024-11-08 23:43:25,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:25,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:25,150 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-08 23:43:25,153 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-08 23:43:25,186 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:43:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:43:25,187 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:43:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 23:43:25,187 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:43:25,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:43:25,273 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:43:25,277 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:43:25,504 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 23:43:25,504 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:43:25,519 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:43:25,519 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:43:25,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:25 BoogieIcfgContainer [2024-11-08 23:43:25,520 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:43:25,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:43:25,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:43:25,525 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:43:25,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:43:24" (1/3) ... [2024-11-08 23:43:25,526 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e824320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:25, skipping insertion in model container [2024-11-08 23:43:25,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:25" (2/3) ... [2024-11-08 23:43:25,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e824320 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:25, skipping insertion in model container [2024-11-08 23:43:25,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:25" (3/3) ... [2024-11-08 23:43:25,528 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-11-08 23:43:25,542 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:43:25,543 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:43:25,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:43:25,596 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;@7368107f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:43:25,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:43:25,602 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:43:25,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:43:25,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:25,611 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:25,612 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:25,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:25,616 INFO L85 PathProgramCache]: Analyzing trace with hash -389053895, now seen corresponding path program 1 times [2024-11-08 23:43:25,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:25,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149474221] [2024-11-08 23:43:25,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:25,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:25,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:25,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:25,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:25,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:43:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:25,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:43:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:43:25,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:43:25,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:25,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149474221] [2024-11-08 23:43:25,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149474221] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:25,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:25,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:43:25,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543308701] [2024-11-08 23:43:25,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:25,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:43:25,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:25,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:43:25,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:43:25,952 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:43:25,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:25,973 INFO L93 Difference]: Finished difference Result 89 states and 141 transitions. [2024-11-08 23:43:25,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:43:25,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-11-08 23:43:25,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:25,981 INFO L225 Difference]: With dead ends: 89 [2024-11-08 23:43:25,981 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 23:43:25,984 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-08 23:43:25,988 INFO L432 NwaCegarLoop]: 63 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, 63 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-08 23:43:25,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:43:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 23:43:26,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 23:43:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:43:26,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-08 23:43:26,019 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 81 [2024-11-08 23:43:26,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:26,020 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-08 23:43:26,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:43:26,020 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-08 23:43:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:43:26,022 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:26,022 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:26,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 23:43:26,023 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:26,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:26,023 INFO L85 PathProgramCache]: Analyzing trace with hash -621505667, now seen corresponding path program 1 times [2024-11-08 23:43:26,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:26,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964739746] [2024-11-08 23:43:26,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:26,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:43:26,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1835267415] [2024-11-08 23:43:26,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:26,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:43:26,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:26,145 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-08 23:43:26,148 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-08 23:43:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:26,248 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-08 23:43:26,255 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:43:26,919 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 182 proven. 27 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-08 23:43:26,919 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:43:27,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:27,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964739746] [2024-11-08 23:43:27,079 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 23:43:27,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835267415] [2024-11-08 23:43:27,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835267415] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:43:27,080 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-08 23:43:27,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2024-11-08 23:43:27,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243263832] [2024-11-08 23:43:27,083 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-08 23:43:27,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-08 23:43:27,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:27,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-08 23:43:27,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=166, Unknown=1, NotChecked=0, Total=210 [2024-11-08 23:43:27,085 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 23:43:27,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:27,613 INFO L93 Difference]: Finished difference Result 133 states and 182 transitions. [2024-11-08 23:43:27,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-08 23:43:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 81 [2024-11-08 23:43:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:27,617 INFO L225 Difference]: With dead ends: 133 [2024-11-08 23:43:27,618 INFO L226 Difference]: Without dead ends: 94 [2024-11-08 23:43:27,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=572, Unknown=1, NotChecked=0, Total=756 [2024-11-08 23:43:27,619 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 73 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 41 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:27,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 231 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 204 Invalid, 4 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 23:43:27,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-08 23:43:27,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2024-11-08 23:43:27,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:43:27,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 103 transitions. [2024-11-08 23:43:27,645 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 103 transitions. Word has length 81 [2024-11-08 23:43:27,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:27,646 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 103 transitions. [2024-11-08 23:43:27,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 11 states have internal predecessors, (36), 3 states have call successors, (12), 3 states have call predecessors, (12), 5 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-08 23:43:27,647 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 103 transitions. [2024-11-08 23:43:27,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:43:27,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:27,649 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:27,663 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-08 23:43:27,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:43:27,858 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:27,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:27,858 INFO L85 PathProgramCache]: Analyzing trace with hash 58552703, now seen corresponding path program 1 times [2024-11-08 23:43:27,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:27,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209726833] [2024-11-08 23:43:27,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:27,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:27,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 23:43:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 23:43:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 23:43:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 23:43:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 23:43:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 23:43:28,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 23:43:28,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 23:43:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-08 23:43:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 23:43:28,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 23:43:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 23:43:28,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-08 23:43:28,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 23:43:28,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209726833] [2024-11-08 23:43:28,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209726833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:28,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:28,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 23:43:28,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557615289] [2024-11-08 23:43:28,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:28,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 23:43:28,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 23:43:28,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 23:43:28,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-08 23:43:28,935 INFO L87 Difference]: Start difference. First operand 76 states and 103 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:43:29,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:29,181 INFO L93 Difference]: Finished difference Result 107 states and 138 transitions. [2024-11-08 23:43:29,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 23:43:29,181 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 81 [2024-11-08 23:43:29,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:29,184 INFO L225 Difference]: With dead ends: 107 [2024-11-08 23:43:29,184 INFO L226 Difference]: Without dead ends: 105 [2024-11-08 23:43:29,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-08 23:43:29,186 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 41 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 23:43:29,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 284 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 23:43:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-08 23:43:29,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 83. [2024-11-08 23:43:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 24 states have call successors, (24), 4 states have call predecessors, (24), 4 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-08 23:43:29,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 112 transitions. [2024-11-08 23:43:29,204 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 112 transitions. Word has length 81 [2024-11-08 23:43:29,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:29,205 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 112 transitions. [2024-11-08 23:43:29,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-08 23:43:29,205 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 112 transitions. [2024-11-08 23:43:29,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:43:29,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:29,206 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:29,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 23:43:29,206 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:29,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:29,207 INFO L85 PathProgramCache]: Analyzing trace with hash 60399745, now seen corresponding path program 1 times [2024-11-08 23:43:29,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 23:43:29,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642914431] [2024-11-08 23:43:29,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:29,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 23:43:29,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 23:43:29,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [445532720] [2024-11-08 23:43:29,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:29,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 23:43:29,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:29,272 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-08 23:43:29,273 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-08 23:43:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:43:29,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 23:43:29,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 23:43:29,402 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 23:43:29,402 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 23:43:29,404 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 23:43:29,422 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 23:43:29,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-08 23:43:29,610 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-08 23:43:29,681 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 23:43:29,684 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 11:43:29 BoogieIcfgContainer [2024-11-08 23:43:29,684 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 23:43:29,685 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 23:43:29,685 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 23:43:29,685 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 23:43:29,685 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:25" (3/4) ... [2024-11-08 23:43:29,687 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 23:43:29,688 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 23:43:29,689 INFO L158 Benchmark]: Toolchain (without parser) took 4909.55ms. Allocated memory was 157.3MB in the beginning and 274.7MB in the end (delta: 117.4MB). Free memory was 84.9MB in the beginning and 220.7MB in the end (delta: -135.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:43:29,689 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 109.6MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:43:29,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.23ms. Allocated memory is still 157.3MB. Free memory was 84.5MB in the beginning and 70.5MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-08 23:43:29,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.11ms. Allocated memory is still 157.3MB. Free memory was 70.5MB in the beginning and 67.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 23:43:29,690 INFO L158 Benchmark]: Boogie Preprocessor took 44.15ms. Allocated memory is still 157.3MB. Free memory was 67.8MB in the beginning and 63.9MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 23:43:29,690 INFO L158 Benchmark]: RCFGBuilder took 407.87ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 63.9MB in the beginning and 177.4MB in the end (delta: -113.5MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2024-11-08 23:43:29,691 INFO L158 Benchmark]: TraceAbstraction took 4162.45ms. Allocated memory was 218.1MB in the beginning and 274.7MB in the end (delta: 56.6MB). Free memory was 177.4MB in the beginning and 220.7MB in the end (delta: -43.3MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-11-08 23:43:29,691 INFO L158 Benchmark]: Witness Printer took 3.95ms. Allocated memory is still 274.7MB. Free memory is still 220.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 23:43:29,692 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 157.3MB. Free memory was 109.8MB in the beginning and 109.6MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 245.23ms. Allocated memory is still 157.3MB. Free memory was 84.5MB in the beginning and 70.5MB in the end (delta: 14.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.11ms. Allocated memory is still 157.3MB. Free memory was 70.5MB in the beginning and 67.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.15ms. Allocated memory is still 157.3MB. Free memory was 67.8MB in the beginning and 63.9MB in the end (delta: 3.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 407.87ms. Allocated memory was 157.3MB in the beginning and 218.1MB in the end (delta: 60.8MB). Free memory was 63.9MB in the beginning and 177.4MB in the end (delta: -113.5MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4162.45ms. Allocated memory was 218.1MB in the beginning and 274.7MB in the end (delta: 56.6MB). Free memory was 177.4MB in the beginning and 220.7MB in the end (delta: -43.3MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Witness Printer took 3.95ms. Allocated memory is still 274.7MB. Free memory is still 220.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 90. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 64; [L23] signed long int var_1_2 = 8; [L24] unsigned char var_1_3 = 25; [L25] unsigned char var_1_4 = 100; [L26] float var_1_5 = 99999999999.5; [L27] unsigned char var_1_6 = 4; [L28] float var_1_7 = 63.75; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 1; [L31] unsigned char last_1_var_1_1 = 64; [L32] unsigned char last_1_var_1_9 = 0; VAL [isInitial=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L94] isInitial = 1 [L95] FCALL initially() [L96] int k_loop; [L97] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L97] COND TRUE k_loop < 1 [L98] CALL updateLastVariables() [L86] last_1_var_1_1 = var_1_1 [L87] last_1_var_1_9 = var_1_9 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=8, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L98] RET updateLastVariables() [L99] CALL updateVariables() [L66] var_1_2 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_2 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L67] RET assume_abort_if_not(var_1_2 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] CALL assume_abort_if_not(var_1_2 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L68] RET assume_abort_if_not(var_1_2 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=25, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L69] var_1_3 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L70] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_3 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L71] RET assume_abort_if_not(var_1_3 <= 254) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=100, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L72] var_1_4 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_4 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L73] RET assume_abort_if_not(var_1_4 >= 63) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_4 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L74] RET assume_abort_if_not(var_1_4 <= 127) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=4, var_1_7=255/4, var_1_9=0] [L75] var_1_6 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L76] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_6 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L77] RET assume_abort_if_not(var_1_6 <= 255) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_7=255/4, var_1_9=0] [L78] CALL assume_abort_if_not(var_1_6 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L78] RET assume_abort_if_not(var_1_6 != 0) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_7=255/4, var_1_9=0] [L79] var_1_7 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L80] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L81] var_1_10 = __VERIFIER_nondet_uchar() [L82] CALL assume_abort_if_not(var_1_10 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L82] RET assume_abort_if_not(var_1_10 >= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L83] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L99] RET updateVariables() [L100] CALL step() [L36] signed long int stepLocal_3 = last_1_var_1_1; [L37] signed long int stepLocal_2 = var_1_3 / var_1_6; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, stepLocal_3=64, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L38] COND TRUE var_1_3 < stepLocal_3 VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_2=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L39] COND FALSE !(var_1_4 < stepLocal_2) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L49] signed long int stepLocal_1 = var_1_2; [L50] signed long int stepLocal_0 = var_1_2; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_1=-256, var_1_10=1, var_1_1=64, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L51] COND TRUE stepLocal_1 <= -256 [L52] var_1_1 = ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L60] unsigned char stepLocal_4 = (var_1_1 + 64u) != var_1_4; VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, stepLocal_4=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L61] COND FALSE !((var_1_5 >= var_1_7) || stepLocal_4) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, stepLocal_0=-256, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L100] RET step() [L101] CALL, EXPR property() [L90-L91] return (((var_1_2 <= -256) ? (var_1_1 == ((unsigned char) ((((var_1_3) < (((var_1_4 - 8) + 5))) ? (var_1_3) : (((var_1_4 - 8) + 5)))))) : ((var_1_4 <= var_1_2) ? (var_1_1 == ((unsigned char) var_1_3)) : (var_1_1 == ((unsigned char) var_1_3)))) && ((var_1_3 < last_1_var_1_1) ? ((var_1_4 < (var_1_3 / var_1_6)) ? (var_1_5 == ((float) (var_1_7 - 16.55f))) : 1) : (last_1_var_1_9 ? (var_1_5 == ((float) var_1_7)) : (var_1_5 == ((float) var_1_7))))) && (((var_1_5 >= var_1_7) || ((var_1_1 + 64u) != var_1_4)) ? (var_1_9 == ((unsigned char) var_1_10)) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L101] RET, EXPR property() [L101] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=64, last_1_var_1_9=0, var_1_10=1, var_1_1=0, var_1_2=-256, var_1_3=0, var_1_4=64, var_1_5=199999999999/2, var_1_6=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 4, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4 mSolverCounterUnknown, 114 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 578 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 432 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 329 IncrementalHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 146 mSDtfsCounter, 329 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 40 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 240 ConstructedInterpolants, 2 QuantifiedInterpolants, 1153 SizeOfPredicates, 5 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 765/792 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-08 23:43:29,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.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 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 23:43:31,662 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 23:43:31,727 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 23:43:31,733 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 23:43:31,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 23:43:31,762 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 23:43:31,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 23:43:31,765 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 23:43:31,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 23:43:31,767 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 23:43:31,768 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 23:43:31,768 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 23:43:31,768 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 23:43:31,769 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 23:43:31,769 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 23:43:31,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 23:43:31,772 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 23:43:31,772 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 23:43:31,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 23:43:31,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 23:43:31,772 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 23:43:31,773 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 23:43:31,773 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 23:43:31,773 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 23:43:31,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 23:43:31,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 23:43:31,775 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 23:43:31,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 23:43:31,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 23:43:31,776 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 23:43:31,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 23:43:31,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 23:43:31,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 23:43:31,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 23:43:31,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:31,790 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 23:43:31,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 23:43:31,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 23:43:31,790 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 23:43:31,790 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 23:43:31,790 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 23:43:31,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 23:43:31,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 23:43:31,791 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 23:43:31,791 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 -> 01455e7c8aff792a978e20323062f0f7b0c441ba70dceb4bfdd7b2a7e2a8be23 [2024-11-08 23:43:32,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 23:43:32,077 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 23:43:32,083 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 23:43:32,084 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 23:43:32,084 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 23:43:32,085 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-11-08 23:43:33,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 23:43:33,633 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 23:43:33,634 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-11-08 23:43:33,642 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b843c4c1/8d0b4b26324e4b2491ad25c5c6375981/FLAGe0cc5f0ff [2024-11-08 23:43:33,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b843c4c1/8d0b4b26324e4b2491ad25c5c6375981 [2024-11-08 23:43:33,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 23:43:33,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 23:43:33,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:33,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 23:43:33,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 23:43:33,665 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:33,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6308264e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33, skipping insertion in model container [2024-11-08 23:43:33,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:33,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 23:43:33,843 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i[915,928] [2024-11-08 23:43:33,881 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:33,893 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 23:43:33,905 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-58.i[915,928] [2024-11-08 23:43:33,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 23:43:33,942 INFO L204 MainTranslator]: Completed translation [2024-11-08 23:43:33,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33 WrapperNode [2024-11-08 23:43:33,943 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 23:43:33,944 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:33,944 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 23:43:33,944 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 23:43:33,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:33,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:33,980 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-11-08 23:43:33,982 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 23:43:33,983 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 23:43:33,983 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 23:43:33,983 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 23:43:33,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:33,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:33,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,008 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-08 23:43:34,008 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,008 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,019 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,038 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,042 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,044 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 23:43:34,044 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 23:43:34,044 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 23:43:34,044 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 23:43:34,045 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (1/1) ... [2024-11-08 23:43:34,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 23:43:34,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 23:43:34,078 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-08 23:43:34,080 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-08 23:43:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 23:43:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 23:43:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 23:43:34,117 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 23:43:34,117 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 23:43:34,117 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 23:43:34,174 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 23:43:34,176 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 23:43:34,456 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-08 23:43:34,456 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 23:43:34,466 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 23:43:34,468 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 23:43:34,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:34 BoogieIcfgContainer [2024-11-08 23:43:34,468 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 23:43:34,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 23:43:34,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 23:43:34,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 23:43:34,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 11:43:33" (1/3) ... [2024-11-08 23:43:34,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd32f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:34, skipping insertion in model container [2024-11-08 23:43:34,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 11:43:33" (2/3) ... [2024-11-08 23:43:34,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd32f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 11:43:34, skipping insertion in model container [2024-11-08 23:43:34,475 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 11:43:34" (3/3) ... [2024-11-08 23:43:34,475 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-58.i [2024-11-08 23:43:34,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 23:43:34,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 23:43:34,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 23:43:34,544 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;@502b6e75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 23:43:34,545 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 23:43:34,548 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:43:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:43:34,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:34,556 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:34,556 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:34,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:34,561 INFO L85 PathProgramCache]: Analyzing trace with hash -389053895, now seen corresponding path program 1 times [2024-11-08 23:43:34,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:43:34,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503256674] [2024-11-08 23:43:34,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:34,571 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-08 23:43:34,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:43:34,574 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-08 23:43:34,575 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-08 23:43:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:34,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 23:43:34,715 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:43:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2024-11-08 23:43:34,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 23:43:34,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:43:34,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503256674] [2024-11-08 23:43:34,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503256674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 23:43:34,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 23:43:34,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 23:43:34,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074301041] [2024-11-08 23:43:34,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 23:43:34,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 23:43:34,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 23:43:34,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 23:43:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 23:43:34,789 INFO L87 Difference]: Start difference. First operand has 46 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 32 states have internal predecessors, (42), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:43:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 23:43:34,811 INFO L93 Difference]: Finished difference Result 89 states and 141 transitions. [2024-11-08 23:43:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 23:43:34,813 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 81 [2024-11-08 23:43:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 23:43:34,819 INFO L225 Difference]: With dead ends: 89 [2024-11-08 23:43:34,820 INFO L226 Difference]: Without dead ends: 42 [2024-11-08 23:43:34,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-08 23:43:34,828 INFO L432 NwaCegarLoop]: 63 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, 63 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-08 23:43:34,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 23:43:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-08 23:43:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-08 23:43:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.25) internal successors, (35), 28 states have internal predecessors, (35), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-08 23:43:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2024-11-08 23:43:34,867 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 81 [2024-11-08 23:43:34,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 23:43:34,868 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2024-11-08 23:43:34,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-08 23:43:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2024-11-08 23:43:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-11-08 23:43:34,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 23:43:34,872 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:43:34,878 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-08 23:43:35,072 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-08 23:43:35,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 23:43:35,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 23:43:35,074 INFO L85 PathProgramCache]: Analyzing trace with hash -621505667, now seen corresponding path program 1 times [2024-11-08 23:43:35,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 23:43:35,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662128764] [2024-11-08 23:43:35,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:35,082 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-08 23:43:35,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 23:43:35,084 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-08 23:43:35,092 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-08 23:43:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:35,232 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-08 23:43:35,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:43:36,357 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 179 proven. 39 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-08 23:43:36,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 23:43:53,440 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 23:43:53,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1662128764] [2024-11-08 23:43:53,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1662128764] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 23:43:53,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1097298112] [2024-11-08 23:43:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 23:43:53,443 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 23:43:53,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 23:43:53,445 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 23:43:53,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-08 23:43:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 23:43:53,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 23:43:53,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 23:44:14,022 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 181 proven. 36 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-08 23:44:14,023 INFO L311 TraceCheckSpWp]: Computing backward predicates...