./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.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 9437d1cfddee7218df8fa3dfbeae56bca9eead9fe5750ca345ccb47639179368 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:49:09,210 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:49:09,251 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:49:09,254 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:49:09,254 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:49:09,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:49:09,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:49:09,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:49:09,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:49:09,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:49:09,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:49:09,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:49:09,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:49:09,282 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:49:09,282 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:49:09,282 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:49:09,282 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:49:09,282 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:49:09,283 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:49:09,283 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:49:09,283 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:49:09,285 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:49:09,286 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:49:09,286 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:49:09,286 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:49:09,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:49:09,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:49:09,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:49:09,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:49:09,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:49:09,287 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:49:09,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:49:09,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:49:09,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:49:09,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:49:09,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:49:09,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:49:09,288 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:49:09,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:49:09,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:49:09,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:49:09,289 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:49:09,289 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 -> 9437d1cfddee7218df8fa3dfbeae56bca9eead9fe5750ca345ccb47639179368 [2024-10-24 09:49:09,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:49:09,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:49:09,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:49:09,547 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:49:09,548 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:49:09,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i [2024-10-24 09:49:10,791 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:49:10,972 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:49:10,972 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i [2024-10-24 09:49:10,981 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b51b5eb3/157b6c8a32b64a66a50b577f529b7045/FLAGd466bde7d [2024-10-24 09:49:10,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b51b5eb3/157b6c8a32b64a66a50b577f529b7045 [2024-10-24 09:49:11,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:49:11,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:49:11,002 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:49:11,002 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:49:11,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:49:11,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:49:10" (1/1) ... [2024-10-24 09:49:11,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37ba91b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11, skipping insertion in model container [2024-10-24 09:49:11,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:49:10" (1/1) ... [2024-10-24 09:49:11,025 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:49:11,159 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i[915,928] [2024-10-24 09:49:11,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:49:11,214 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:49:11,223 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i[915,928] [2024-10-24 09:49:11,243 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:49:11,258 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:49:11,258 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11 WrapperNode [2024-10-24 09:49:11,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:49:11,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:49:11,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:49:11,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:49:11,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,274 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,321 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-24 09:49:11,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:49:11,324 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:49:11,324 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:49:11,325 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:49:11,333 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,335 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,351 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:49:11,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,360 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,363 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:49:11,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:49:11,366 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:49:11,366 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:49:11,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (1/1) ... [2024-10-24 09:49:11,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:49:11,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:49:11,409 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:49:11,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:49:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:49:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:49:11,448 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:49:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:49:11,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:49:11,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:49:11,507 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:49:11,509 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:49:11,789 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 09:49:11,793 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:49:11,842 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:49:11,844 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:49:11,844 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:49:11 BoogieIcfgContainer [2024-10-24 09:49:11,844 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:49:11,846 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:49:11,846 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:49:11,848 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:49:11,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:49:10" (1/3) ... [2024-10-24 09:49:11,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2015dd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:49:11, skipping insertion in model container [2024-10-24 09:49:11,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:11" (2/3) ... [2024-10-24 09:49:11,849 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2015dd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:49:11, skipping insertion in model container [2024-10-24 09:49:11,849 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:49:11" (3/3) ... [2024-10-24 09:49:11,850 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-48.i [2024-10-24 09:49:11,862 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:49:11,862 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:49:11,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:49:11,916 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;@36e32e3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:49:11,917 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:49:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:49:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:49:11,928 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:11,929 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:11,929 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:11,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:11,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1835224988, now seen corresponding path program 1 times [2024-10-24 09:49:11,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:49:11,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232657850] [2024-10-24 09:49:11,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:11,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:49:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:49:12,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:49:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:49:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:49:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:49:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:49:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:49:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:49:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 09:49:12,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:49:12,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:49:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:49:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 09:49:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:49:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:49:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:49:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:49:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:49:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 09:49:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:49:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:49:12,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:49:12,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232657850] [2024-10-24 09:49:12,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232657850] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:49:12,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:49:12,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:49:12,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782894390] [2024-10-24 09:49:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:49:12,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:49:12,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:49:12,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:49:12,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:49:12,281 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:49:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:49:12,329 INFO L93 Difference]: Finished difference Result 116 states and 203 transitions. [2024-10-24 09:49:12,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:49:12,332 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-24 09:49:12,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:49:12,339 INFO L225 Difference]: With dead ends: 116 [2024-10-24 09:49:12,340 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 09:49:12,344 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:49:12,347 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:49:12,349 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:49:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 09:49:12,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 09:49:12,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:49:12,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-24 09:49:12,384 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-24 09:49:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:49:12,385 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-24 09:49:12,385 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, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:49:12,385 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-24 09:49:12,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:49:12,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:12,388 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:12,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:49:12,388 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:12,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1891974252, now seen corresponding path program 1 times [2024-10-24 09:49:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:49:12,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212173250] [2024-10-24 09:49:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:49:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:49:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:49:12,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:49:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:49:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:49:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:49:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:49:12,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:49:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 09:49:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:49:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:49:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:49:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 09:49:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:49:12,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:49:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:49:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:49:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:49:12,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 09:49:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:49:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:49:12,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:49:12,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212173250] [2024-10-24 09:49:12,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212173250] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:49:12,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:49:12,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:49:12,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166919524] [2024-10-24 09:49:12,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:49:12,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:49:12,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:49:12,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:49:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:49:12,611 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:49:12,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:49:12,655 INFO L93 Difference]: Finished difference Result 127 states and 193 transitions. [2024-10-24 09:49:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:49:12,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 09:49:12,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:49:12,658 INFO L225 Difference]: With dead ends: 127 [2024-10-24 09:49:12,659 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 09:49:12,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:49:12,662 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:49:12,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 153 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:49:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 09:49:12,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2024-10-24 09:49:12,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:49:12,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-10-24 09:49:12,676 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 125 [2024-10-24 09:49:12,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:49:12,678 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-10-24 09:49:12,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:49:12,679 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-10-24 09:49:12,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:49:12,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:12,680 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:12,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:49:12,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:12,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:12,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1890127210, now seen corresponding path program 1 times [2024-10-24 09:49:12,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:49:12,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759009726] [2024-10-24 09:49:12,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:12,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:49:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:49:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 09:49:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 09:49:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 09:49:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-24 09:49:12,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:49:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:49:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-24 09:49:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-24 09:49:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-24 09:49:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-24 09:49:12,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-24 09:49:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-24 09:49:12,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 09:49:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-24 09:49:12,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-24 09:49:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-24 09:49:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-24 09:49:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-24 09:49:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-24 09:49:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:12,887 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:49:12,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:49:12,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759009726] [2024-10-24 09:49:12,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759009726] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:49:12,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:49:12,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:49:12,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727904566] [2024-10-24 09:49:12,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:49:12,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:49:12,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:49:12,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:49:12,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:49:12,891 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:49:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:49:12,940 INFO L93 Difference]: Finished difference Result 187 states and 283 transitions. [2024-10-24 09:49:12,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:49:12,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 09:49:12,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:49:12,943 INFO L225 Difference]: With dead ends: 187 [2024-10-24 09:49:12,943 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 09:49:12,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:49:12,947 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:49:12,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 155 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:49:12,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 09:49:12,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-24 09:49:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:49:12,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 186 transitions. [2024-10-24 09:49:12,964 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 186 transitions. Word has length 125 [2024-10-24 09:49:12,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:49:12,964 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 186 transitions. [2024-10-24 09:49:12,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:49:12,965 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 186 transitions. [2024-10-24 09:49:12,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:49:12,966 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:12,966 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:12,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:49:12,967 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:12,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:12,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1535219104, now seen corresponding path program 1 times [2024-10-24 09:49:12,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:49:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920518563] [2024-10-24 09:49:12,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:49:13,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:49:13,068 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:49:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:49:13,151 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:49:13,151 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:49:13,153 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:49:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:49:13,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 09:49:13,232 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:49:13,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:49:13 BoogieIcfgContainer [2024-10-24 09:49:13,235 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:49:13,235 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:49:13,235 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:49:13,236 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:49:13,236 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:49:11" (3/4) ... [2024-10-24 09:49:13,237 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:49:13,238 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:49:13,239 INFO L158 Benchmark]: Toolchain (without parser) took 2237.39ms. Allocated memory is still 172.0MB. Free memory was 142.9MB in the beginning and 55.8MB in the end (delta: 87.1MB). Peak memory consumption was 87.4MB. Max. memory is 16.1GB. [2024-10-24 09:49:13,239 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 104.9MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:49:13,239 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.69ms. Allocated memory is still 172.0MB. Free memory was 142.9MB in the beginning and 127.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 09:49:13,239 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.56ms. Allocated memory is still 172.0MB. Free memory was 127.5MB in the beginning and 123.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 09:49:13,239 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 172.0MB. Free memory was 123.3MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:49:13,240 INFO L158 Benchmark]: RCFGBuilder took 478.12ms. Allocated memory is still 172.0MB. Free memory was 118.0MB in the beginning and 131.3MB in the end (delta: -13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-24 09:49:13,240 INFO L158 Benchmark]: TraceAbstraction took 1389.43ms. Allocated memory is still 172.0MB. Free memory was 130.2MB in the beginning and 55.8MB in the end (delta: 74.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. [2024-10-24 09:49:13,240 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 172.0MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:49:13,245 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.08ms. Allocated memory is still 104.9MB. Free memory is still 77.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 256.69ms. Allocated memory is still 172.0MB. Free memory was 142.9MB in the beginning and 127.5MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.56ms. Allocated memory is still 172.0MB. Free memory was 127.5MB in the beginning and 123.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 172.0MB. Free memory was 123.3MB in the beginning and 118.0MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 478.12ms. Allocated memory is still 172.0MB. Free memory was 118.0MB in the beginning and 131.3MB in the end (delta: -13.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1389.43ms. Allocated memory is still 172.0MB. Free memory was 130.2MB in the beginning and 55.8MB in the end (delta: 74.5MB). Peak memory consumption was 77.6MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 172.0MB. Free memory is still 55.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 10; [L23] unsigned char var_1_2 = 1; [L24] double var_1_3 = 0.0; [L25] double var_1_4 = 128.2; [L26] double var_1_5 = 50.1; [L27] double var_1_6 = 64.5; [L28] unsigned short int var_1_7 = 1; [L29] unsigned char var_1_8 = 5; [L30] double var_1_9 = 15.35; [L31] unsigned char var_1_10 = 10; [L32] unsigned char var_1_11 = 2; [L33] signed long int var_1_12 = 32; [L34] signed long int var_1_13 = 256; [L35] signed char var_1_14 = 1; [L36] unsigned char var_1_15 = 128; [L37] unsigned char var_1_16 = 0; [L38] signed char var_1_17 = -64; [L39] unsigned short int var_1_18 = 64; [L40] unsigned char last_1_var_1_8 = 5; [L41] unsigned short int last_1_var_1_18 = 64; [L141] isInitial = 1 [L142] FCALL initially() [L143] int k_loop; [L144] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=1, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L144] COND TRUE k_loop < 1 [L145] CALL updateLastVariables() [L133] last_1_var_1_8 = var_1_8 [L134] last_1_var_1_18 = var_1_18 [L145] RET updateLastVariables() [L146] CALL updateVariables() [L99] var_1_2 = __VERIFIER_nondet_uchar() [L100] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L100] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L101] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_3=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L102] var_1_3 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L103] RET assume_abort_if_not((var_1_3 >= 4611686.018427387900e+12F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_4=641/5, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L104] var_1_4 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L105] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 4611686.018427387900e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_5=501/10, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L106] var_1_5 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L107] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_6=129/2, var_1_7=1, var_1_8=5, var_1_9=307/20] [L108] var_1_6 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L109] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854776000e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=1, var_1_8=5, var_1_9=307/20] [L110] var_1_7 = __VERIFIER_nondet_ushort() [L111] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L111] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_8=5, var_1_9=307/20] [L112] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L112] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5, var_1_9=307/20] [L113] var_1_9 = __VERIFIER_nondet_double() [L114] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L114] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L115] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=10, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L116] var_1_10 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L117] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L118] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=2, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L119] var_1_11 = __VERIFIER_nondet_uchar() [L120] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L120] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L121] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=128, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L122] var_1_15 = __VERIFIER_nondet_uchar() [L123] CALL assume_abort_if_not(var_1_15 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L123] RET assume_abort_if_not(var_1_15 >= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] CALL assume_abort_if_not(var_1_15 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L124] RET assume_abort_if_not(var_1_15 <= 255) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=0, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L125] var_1_16 = __VERIFIER_nondet_uchar() [L126] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L126] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L127] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=-64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L128] var_1_17 = __VERIFIER_nondet_char() [L129] CALL assume_abort_if_not(var_1_17 >= -126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L129] RET assume_abort_if_not(var_1_17 >= -126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L130] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L130] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=10, var_1_2=0, var_1_7=0, var_1_8=5] [L146] RET updateVariables() [L147] CALL step() [L45] COND FALSE !(\read(var_1_2)) [L52] var_1_1 = 1 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L54] unsigned short int stepLocal_0 = var_1_1; VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=5] [L55] COND TRUE var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9)))) [L56] var_1_8 = ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=32, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L64] COND FALSE !(\read(var_1_2)) [L73] var_1_12 = last_1_var_1_18 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L75] signed long int stepLocal_1 = ((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)); VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, stepLocal_1=191, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=1, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L76] COND TRUE var_1_10 == stepLocal_1 [L77] var_1_14 = ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L81] COND FALSE !(\read(var_1_2)) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L84] COND FALSE !(var_1_8 == var_1_13) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=64, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L87] COND FALSE !(last_1_var_1_18 != var_1_16) [L94] var_1_18 = var_1_10 VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, stepLocal_0=1, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L147] RET step() [L148] CALL, EXPR property() [L137-L138] return (((((var_1_2 ? ((((var_1_3 - var_1_4) - var_1_5) == (15.75 - var_1_6)) ? (var_1_1 == ((unsigned short int) (5 + last_1_var_1_8))) : (var_1_1 == ((unsigned short int) last_1_var_1_8))) : (var_1_1 == ((unsigned short int) 1))) && ((var_1_6 > (var_1_5 / ((((var_1_3) > (var_1_9)) ? (var_1_3) : (var_1_9))))) ? (var_1_8 == ((unsigned char) ((((var_1_10) < 0 ) ? -(var_1_10) : (var_1_10))))) : ((var_1_1 <= var_1_7) ? (var_1_8 == ((unsigned char) var_1_10)) : (var_1_8 == ((unsigned char) var_1_11))))) && (var_1_2 ? ((-128 > var_1_10) ? ((var_1_3 >= (2.75 / var_1_9)) ? (var_1_12 == ((signed long int) (var_1_11 + (last_1_var_1_18 + var_1_10)))) : (var_1_12 == ((signed long int) last_1_var_1_18))) : 1) : (var_1_12 == ((signed long int) last_1_var_1_18)))) && (var_1_2 ? (var_1_13 == ((signed long int) var_1_11)) : 1)) && ((var_1_10 == (((((var_1_15 - var_1_16)) > (var_1_12)) ? ((var_1_15 - var_1_16)) : (var_1_12)))) ? (var_1_14 == ((signed char) ((((var_1_17) < 0 ) ? -(var_1_17) : (var_1_17))))) : (var_1_14 == ((signed char) var_1_17)))) && ((var_1_8 == var_1_13) ? (var_1_18 == ((unsigned short int) (var_1_10 + ((((var_1_14) < (var_1_16)) ? (var_1_14) : (var_1_16)))))) : ((last_1_var_1_18 != var_1_16) ? ((-256 >= var_1_13) ? (var_1_18 == ((unsigned short int) var_1_16)) : (var_1_18 == ((unsigned short int) var_1_15))) : (var_1_18 == ((unsigned short int) var_1_10)))) ; [L148] RET, EXPR property() [L148] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] [L19] reach_error() VAL [isInitial=1, last_1_var_1_18=64, last_1_var_1_8=5, var_1_10=191, var_1_11=254, var_1_12=64, var_1_13=256, var_1_14=64, var_1_15=255, var_1_16=64, var_1_17=64, var_1_18=191, var_1_1=1, var_1_2=0, var_1_7=0, var_1_8=191] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 59 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 57 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 390 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 240 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=3, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 11 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 501 NumberOfCodeBlocks, 501 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 372 ConstructedInterpolants, 0 QuantifiedInterpolants, 478 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:49:13,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.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 9437d1cfddee7218df8fa3dfbeae56bca9eead9fe5750ca345ccb47639179368 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:49:14,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:49:15,010 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:49:15,015 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:49:15,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:49:15,038 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:49:15,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:49:15,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:49:15,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:49:15,042 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:49:15,042 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:49:15,042 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:49:15,043 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:49:15,043 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:49:15,044 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:49:15,044 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:49:15,045 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:49:15,045 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:49:15,045 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:49:15,045 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:49:15,048 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:49:15,048 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:49:15,049 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:49:15,050 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:49:15,050 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:49:15,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:49:15,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:49:15,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:49:15,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:49:15,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:49:15,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:49:15,061 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:49:15,061 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:49:15,061 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:49:15,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:49:15,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:49:15,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:49:15,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:49:15,063 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:49:15,063 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 -> 9437d1cfddee7218df8fa3dfbeae56bca9eead9fe5750ca345ccb47639179368 [2024-10-24 09:49:15,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:49:15,335 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:49:15,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:49:15,338 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:49:15,339 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:49:15,340 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i [2024-10-24 09:49:16,574 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:49:16,760 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:49:16,760 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i [2024-10-24 09:49:16,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea2f4bf2/eac0b57228594354b60d268046f20605/FLAG9a8087288 [2024-10-24 09:49:16,782 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ea2f4bf2/eac0b57228594354b60d268046f20605 [2024-10-24 09:49:16,784 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:49:16,785 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:49:16,788 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:49:16,788 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:49:16,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:49:16,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:49:16" (1/1) ... [2024-10-24 09:49:16,795 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24b6d817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:16, skipping insertion in model container [2024-10-24 09:49:16,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:49:16" (1/1) ... [2024-10-24 09:49:16,820 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:49:16,970 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i[915,928] [2024-10-24 09:49:17,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:49:17,051 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:49:17,063 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-48.i[915,928] [2024-10-24 09:49:17,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:49:17,118 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:49:17,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17 WrapperNode [2024-10-24 09:49:17,119 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:49:17,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:49:17,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:49:17,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:49:17,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,139 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,170 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 147 [2024-10-24 09:49:17,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:49:17,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:49:17,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:49:17,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:49:17,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,187 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:49:17,207 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,220 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,228 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:49:17,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:49:17,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:49:17,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:49:17,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (1/1) ... [2024-10-24 09:49:17,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:49:17,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:49:17,268 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:49:17,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:49:17,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:49:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:49:17,304 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:49:17,304 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:49:17,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:49:17,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:49:17,384 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:49:17,386 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:49:38,524 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-24 09:49:38,524 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:49:38,574 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:49:38,575 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:49:38,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:49:38 BoogieIcfgContainer [2024-10-24 09:49:38,577 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:49:38,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:49:38,578 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:49:38,581 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:49:38,581 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:49:16" (1/3) ... [2024-10-24 09:49:38,582 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1061b0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:49:38, skipping insertion in model container [2024-10-24 09:49:38,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:49:17" (2/3) ... [2024-10-24 09:49:38,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1061b0fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:49:38, skipping insertion in model container [2024-10-24 09:49:38,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:49:38" (3/3) ... [2024-10-24 09:49:38,584 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-48.i [2024-10-24 09:49:38,597 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:49:38,597 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:49:38,652 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:49:38,659 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;@71eb56d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:49:38,660 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:49:38,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:49:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:49:38,674 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:38,674 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:38,675 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:38,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:38,679 INFO L85 PathProgramCache]: Analyzing trace with hash 1835224988, now seen corresponding path program 1 times [2024-10-24 09:49:38,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:49:38,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450698066] [2024-10-24 09:49:38,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:38,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:49:38,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:49:38,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:49:38,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:49:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:40,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:49:40,048 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:49:40,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 398 proven. 0 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2024-10-24 09:49:40,089 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:49:40,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:49:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450698066] [2024-10-24 09:49:40,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450698066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:49:40,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:49:40,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:49:40,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027128562] [2024-10-24 09:49:40,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:49:40,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:49:40,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:49:40,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:49:40,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:49:40,114 INFO L87 Difference]: Start difference. First operand has 59 states, 36 states have (on average 1.4722222222222223) internal successors, (53), 37 states have internal predecessors, (53), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:49:44,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:49:44,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:49:44,758 INFO L93 Difference]: Finished difference Result 116 states and 203 transitions. [2024-10-24 09:49:44,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:49:44,760 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 125 [2024-10-24 09:49:44,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:49:44,766 INFO L225 Difference]: With dead ends: 116 [2024-10-24 09:49:44,767 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 09:49:44,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:49:44,774 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2024-10-24 09:49:44,775 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2024-10-24 09:49:44,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 09:49:44,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-24 09:49:44,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 states have internal predecessors, (45), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:49:44,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-10-24 09:49:44,812 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 125 [2024-10-24 09:49:44,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:49:44,813 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-10-24 09:49:44,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-24 09:49:44,813 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-10-24 09:49:44,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:49:44,815 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:44,815 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:44,852 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:49:45,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:49:45,017 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:45,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:45,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1891974252, now seen corresponding path program 1 times [2024-10-24 09:49:45,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:49:45,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1739314981] [2024-10-24 09:49:45,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:45,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:49:45,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:49:45,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:49:45,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:49:46,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:49:46,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:49:46,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:49:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:49:46,676 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:49:46,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:49:46,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1739314981] [2024-10-24 09:49:46,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1739314981] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:49:46,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:49:46,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:49:46,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518108557] [2024-10-24 09:49:46,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:49:46,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:49:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:49:46,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:49:46,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:49:46,678 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:49:51,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.43s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:49:55,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:49:59,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:49:59,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:49:59,633 INFO L93 Difference]: Finished difference Result 127 states and 193 transitions. [2024-10-24 09:49:59,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:49:59,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 09:49:59,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:49:59,639 INFO L225 Difference]: With dead ends: 127 [2024-10-24 09:49:59,640 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 09:49:59,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:49:59,642 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2024-10-24 09:49:59,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 152 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 3 Unknown, 0 Unchecked, 12.9s Time] [2024-10-24 09:49:59,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 09:49:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2024-10-24 09:49:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-24 09:49:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 95 transitions. [2024-10-24 09:49:59,652 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 95 transitions. Word has length 125 [2024-10-24 09:49:59,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:49:59,654 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 95 transitions. [2024-10-24 09:49:59,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:49:59,655 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 95 transitions. [2024-10-24 09:49:59,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-24 09:49:59,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:49:59,656 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:49:59,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-10-24 09:49:59,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:49:59,857 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:49:59,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:49:59,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1890127210, now seen corresponding path program 1 times [2024-10-24 09:49:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:49:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1351005474] [2024-10-24 09:49:59,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:49:59,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:49:59,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:49:59,861 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:49:59,863 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:50:01,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:50:01,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:50:01,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:50:06,067 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-24 09:50:06,067 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:50:06,067 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:50:06,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1351005474] [2024-10-24 09:50:06,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1351005474] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:50:06,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:50:06,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:50:06,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236520603] [2024-10-24 09:50:06,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:50:06,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:50:06,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:50:06,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:50:06,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:50:06,069 INFO L87 Difference]: Start difference. First operand 63 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:50:10,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:50:15,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.40s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:50:19,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:50:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:50:19,470 INFO L93 Difference]: Finished difference Result 187 states and 283 transitions. [2024-10-24 09:50:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:50:19,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 125 [2024-10-24 09:50:19,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:50:19,473 INFO L225 Difference]: With dead ends: 187 [2024-10-24 09:50:19,474 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 09:50:19,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:50:19,477 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 18 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:50:19,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 155 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 3 Unknown, 0 Unchecked, 13.4s Time] [2024-10-24 09:50:19,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 09:50:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2024-10-24 09:50:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 80 states have (on average 1.325) internal successors, (106), 80 states have internal predecessors, (106), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-24 09:50:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 186 transitions. [2024-10-24 09:50:19,496 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 186 transitions. Word has length 125 [2024-10-24 09:50:19,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:50:19,497 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 186 transitions. [2024-10-24 09:50:19,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-24 09:50:19,499 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 186 transitions. [2024-10-24 09:50:19,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-24 09:50:19,503 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:50:19,503 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:50:19,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 09:50:19,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:50:19,704 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:50:19,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:50:19,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1535219104, now seen corresponding path program 1 times [2024-10-24 09:50:19,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:50:19,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [268860019] [2024-10-24 09:50:19,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:50:19,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:50:19,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:50:19,708 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:50:19,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 09:50:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:50:20,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-24 09:50:21,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:50:34,561 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:50:42,725 WARN L286 SmtUtils]: Spent 8.16s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-10-24 09:50:51,241 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)