./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d0b18815bc1b79317166cc1872599d5d2207332bfc0f1f8bd57589cdb59dae8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 04:41:17,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 04:41:17,409 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 04:41:17,417 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 04:41:17,419 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 04:41:17,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 04:41:17,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 04:41:17,453 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 04:41:17,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 04:41:17,454 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 04:41:17,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 04:41:17,454 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 04:41:17,456 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 04:41:17,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 04:41:17,458 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 04:41:17,458 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 04:41:17,459 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 04:41:17,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 04:41:17,459 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 04:41:17,459 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 04:41:17,460 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 04:41:17,460 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 04:41:17,461 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 04:41:17,464 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 04:41:17,465 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 04:41:17,465 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 04:41:17,465 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 04:41:17,465 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 04:41:17,465 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 04:41:17,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 04:41:17,466 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 04:41:17,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 04:41:17,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 04:41:17,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 04:41:17,466 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 04:41:17,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 04:41:17,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 04:41:17,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 04:41:17,467 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 04:41:17,468 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0b18815bc1b79317166cc1872599d5d2207332bfc0f1f8bd57589cdb59dae8e [2024-11-22 04:41:17,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 04:41:17,771 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 04:41:17,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 04:41:17,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 04:41:17,776 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 04:41:17,777 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c [2024-11-22 04:41:19,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 04:41:19,504 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 04:41:19,504 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c [2024-11-22 04:41:19,512 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f3df41f/df3d3acaca6b44d7b4ef8c47244a67d6/FLAG5ae9ae6ec [2024-11-22 04:41:19,525 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2f3df41f/df3d3acaca6b44d7b4ef8c47244a67d6 [2024-11-22 04:41:19,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 04:41:19,530 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 04:41:19,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 04:41:19,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 04:41:19,539 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 04:41:19,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,542 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2477e711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19, skipping insertion in model container [2024-11-22 04:41:19,542 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,566 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 04:41:19,702 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c[1245,1258] [2024-11-22 04:41:19,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 04:41:19,761 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 04:41:19,775 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c[1245,1258] [2024-11-22 04:41:19,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 04:41:19,814 INFO L204 MainTranslator]: Completed translation [2024-11-22 04:41:19,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19 WrapperNode [2024-11-22 04:41:19,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 04:41:19,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 04:41:19,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 04:41:19,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 04:41:19,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,830 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,878 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2024-11-22 04:41:19,879 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 04:41:19,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 04:41:19,880 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 04:41:19,880 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 04:41:19,889 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,894 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,912 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-22 04:41:19,912 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,912 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,926 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,940 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,950 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,960 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 04:41:19,961 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 04:41:19,961 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 04:41:19,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 04:41:19,963 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (1/1) ... [2024-11-22 04:41:19,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 04:41:19,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:41:19,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 04:41:20,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 04:41:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 04:41:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 04:41:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 04:41:20,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 04:41:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 04:41:20,149 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 04:41:20,152 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 04:41:20,633 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-22 04:41:20,634 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 04:41:20,646 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 04:41:20,647 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 04:41:20,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:20 BoogieIcfgContainer [2024-11-22 04:41:20,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 04:41:20,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 04:41:20,651 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 04:41:20,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 04:41:20,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:41:19" (1/3) ... [2024-11-22 04:41:20,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e5e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:41:20, skipping insertion in model container [2024-11-22 04:41:20,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:19" (2/3) ... [2024-11-22 04:41:20,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31e5e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:41:20, skipping insertion in model container [2024-11-22 04:41:20,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:20" (3/3) ... [2024-11-22 04:41:20,657 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal18.c [2024-11-22 04:41:20,673 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 04:41:20,673 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 04:41:20,724 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 04:41:20,730 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;@c60c849, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 04:41:20,731 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 04:41:20,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:20,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 04:41:20,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:20,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:20,745 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:20,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:20,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2017394231, now seen corresponding path program 1 times [2024-11-22 04:41:20,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:41:20,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951480995] [2024-11-22 04:41:20,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:20,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:41:20,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:21,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:41:21,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951480995] [2024-11-22 04:41:21,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951480995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:41:21,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:41:21,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:41:21,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289157668] [2024-11-22 04:41:21,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:41:21,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:41:21,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:41:21,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:41:21,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:41:21,441 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:21,523 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2024-11-22 04:41:21,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:41:21,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 04:41:21,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:21,533 INFO L225 Difference]: With dead ends: 121 [2024-11-22 04:41:21,533 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 04:41:21,536 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:41:21,542 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:21,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:41:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 04:41:21,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-22 04:41:21,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-22 04:41:21,578 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 27 [2024-11-22 04:41:21,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:21,578 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-22 04:41:21,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:21,579 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-22 04:41:21,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 04:41:21,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:21,580 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:21,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 04:41:21,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:21,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:21,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1883592983, now seen corresponding path program 1 times [2024-11-22 04:41:21,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:41:21,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532521391] [2024-11-22 04:41:21,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:21,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:41:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:21,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:41:21,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532521391] [2024-11-22 04:41:21,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532521391] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:41:21,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:41:21,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:41:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214128415] [2024-11-22 04:41:21,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:41:21,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:41:21,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:41:21,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:41:21,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:41:21,757 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:21,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:21,794 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2024-11-22 04:41:21,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:41:21,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-22 04:41:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:21,796 INFO L225 Difference]: With dead ends: 122 [2024-11-22 04:41:21,796 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 04:41:21,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:41:21,798 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:21,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:41:21,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 04:41:21,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-22 04:41:21,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:21,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-22 04:41:21,811 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 28 [2024-11-22 04:41:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:21,811 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-22 04:41:21,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:21,812 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-22 04:41:21,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 04:41:21,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:21,813 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:21,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 04:41:21,815 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:21,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:21,816 INFO L85 PathProgramCache]: Analyzing trace with hash 640193872, now seen corresponding path program 1 times [2024-11-22 04:41:21,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:41:21,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264360985] [2024-11-22 04:41:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:41:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:22,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:22,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:41:22,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264360985] [2024-11-22 04:41:22,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264360985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:41:22,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:41:22,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 04:41:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205175028] [2024-11-22 04:41:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:41:22,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 04:41:22,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:41:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 04:41:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 04:41:22,100 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:22,218 INFO L93 Difference]: Finished difference Result 161 states and 227 transitions. [2024-11-22 04:41:22,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:41:22,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 04:41:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:22,220 INFO L225 Difference]: With dead ends: 161 [2024-11-22 04:41:22,220 INFO L226 Difference]: Without dead ends: 108 [2024-11-22 04:41:22,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 04:41:22,221 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 185 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:22,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:41:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-22 04:41:22,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2024-11-22 04:41:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:22,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-22 04:41:22,232 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 29 [2024-11-22 04:41:22,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:22,232 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-22 04:41:22,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-22 04:41:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 04:41:22,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:22,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:22,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 04:41:22,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:22,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:22,236 INFO L85 PathProgramCache]: Analyzing trace with hash -719939504, now seen corresponding path program 1 times [2024-11-22 04:41:22,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:41:22,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095846568] [2024-11-22 04:41:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:22,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:41:22,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:22,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:41:22,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095846568] [2024-11-22 04:41:22,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095846568] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:41:22,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:41:22,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 04:41:22,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666883328] [2024-11-22 04:41:22,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:41:22,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 04:41:22,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:41:22,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 04:41:22,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-22 04:41:22,475 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:22,600 INFO L93 Difference]: Finished difference Result 163 states and 229 transitions. [2024-11-22 04:41:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 04:41:22,601 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-22 04:41:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:22,602 INFO L225 Difference]: With dead ends: 163 [2024-11-22 04:41:22,602 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 04:41:22,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-22 04:41:22,603 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 188 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:22,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 506 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:41:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 04:41:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-11-22 04:41:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:22,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-22 04:41:22,616 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 30 [2024-11-22 04:41:22,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:22,616 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-22 04:41:22,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-22 04:41:22,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-22 04:41:22,617 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:22,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:22,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 04:41:22,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:22,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:22,618 INFO L85 PathProgramCache]: Analyzing trace with hash -523941715, now seen corresponding path program 1 times [2024-11-22 04:41:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:41:22,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313668429] [2024-11-22 04:41:22,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:22,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:41:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:22,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 04:41:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313668429] [2024-11-22 04:41:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313668429] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:41:22,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:41:22,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 04:41:22,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028951277] [2024-11-22 04:41:22,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:41:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 04:41:22,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 04:41:22,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 04:41:22,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-22 04:41:22,938 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:23,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:23,088 INFO L93 Difference]: Finished difference Result 163 states and 228 transitions. [2024-11-22 04:41:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 04:41:23,089 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-22 04:41:23,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:23,089 INFO L225 Difference]: With dead ends: 163 [2024-11-22 04:41:23,089 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 04:41:23,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-22 04:41:23,091 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 183 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:23,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 488 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:41:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 04:41:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2024-11-22 04:41:23,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:23,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2024-11-22 04:41:23,100 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 31 [2024-11-22 04:41:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:23,103 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2024-11-22 04:41:23,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:23,104 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2024-11-22 04:41:23,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 04:41:23,104 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:23,104 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:23,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 04:41:23,105 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:23,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:23,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1792746033, now seen corresponding path program 1 times [2024-11-22 04:41:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 04:41:23,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322608198] [2024-11-22 04:41:23,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:23,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 04:41:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 04:41:23,134 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 04:41:23,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 04:41:23,177 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 04:41:23,178 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 04:41:23,179 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 04:41:23,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 04:41:23,183 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-22 04:41:23,220 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 04:41:23,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:41:23 BoogieIcfgContainer [2024-11-22 04:41:23,225 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 04:41:23,225 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 04:41:23,225 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 04:41:23,225 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 04:41:23,226 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:20" (3/4) ... [2024-11-22 04:41:23,228 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 04:41:23,229 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 04:41:23,229 INFO L158 Benchmark]: Toolchain (without parser) took 3699.73ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 126.3MB in the beginning and 61.9MB in the end (delta: 64.4MB). Peak memory consumption was 108.2MB. Max. memory is 16.1GB. [2024-11-22 04:41:23,230 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 04:41:23,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.74ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 109.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 04:41:23,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.95ms. Allocated memory is still 159.4MB. Free memory was 109.7MB in the beginning and 102.8MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 04:41:23,232 INFO L158 Benchmark]: Boogie Preprocessor took 80.73ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 98.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 04:41:23,232 INFO L158 Benchmark]: RCFGBuilder took 686.82ms. Allocated memory is still 159.4MB. Free memory was 98.0MB in the beginning and 106.9MB in the end (delta: -9.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-22 04:41:23,233 INFO L158 Benchmark]: TraceAbstraction took 2575.24ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 105.9MB in the beginning and 63.0MB in the end (delta: 42.9MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. [2024-11-22 04:41:23,233 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 203.4MB. Free memory was 63.0MB in the beginning and 61.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 04:41:23,234 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.11ms. Allocated memory is still 125.8MB. Free memory was 87.7MB in the beginning and 87.6MB in the end (delta: 120.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.74ms. Allocated memory is still 159.4MB. Free memory was 126.3MB in the beginning and 109.7MB in the end (delta: 16.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.95ms. Allocated memory is still 159.4MB. Free memory was 109.7MB in the beginning and 102.8MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.73ms. Allocated memory is still 159.4MB. Free memory was 102.8MB in the beginning and 98.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 686.82ms. Allocated memory is still 159.4MB. Free memory was 98.0MB in the beginning and 106.9MB in the end (delta: -9.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2575.24ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 105.9MB in the beginning and 63.0MB in the end (delta: 42.9MB). Peak memory consumption was 90.1MB. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 203.4MB. Free memory was 63.0MB in the beginning and 61.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: 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 bitwiseOr at line 92, overapproximation of bitwiseAnd at line 97. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_39 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, var_10=0, var_14=0, var_29=1, var_39=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 0; VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L79] EXPR var_20 & mask_SORT_1 VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_29=1, var_39=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 0; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_24=0, var_29=1, var_39=1] [L86] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_26_arg_0=-1, var_26_arg_1=1, var_29=1, var_39=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1, var_39=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 1894 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 442 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 04:41:23,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash d0b18815bc1b79317166cc1872599d5d2207332bfc0f1f8bd57589cdb59dae8e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 04:41:25,356 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 04:41:25,432 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 04:41:25,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 04:41:25,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 04:41:25,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 04:41:25,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 04:41:25,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 04:41:25,485 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 04:41:25,486 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 04:41:25,486 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 04:41:25,486 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 04:41:25,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 04:41:25,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 04:41:25,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 04:41:25,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 04:41:25,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 04:41:25,489 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 04:41:25,489 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 04:41:25,489 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 04:41:25,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 04:41:25,493 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 04:41:25,493 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 04:41:25,493 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 04:41:25,493 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 04:41:25,494 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 04:41:25,494 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 04:41:25,494 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 04:41:25,495 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 04:41:25,495 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 04:41:25,495 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 04:41:25,495 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 04:41:25,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 04:41:25,497 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 04:41:25,497 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 04:41:25,497 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 04:41:25,498 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 04:41:25,498 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 04:41:25,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 04:41:25,499 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 04:41:25,499 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 04:41:25,500 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d0b18815bc1b79317166cc1872599d5d2207332bfc0f1f8bd57589cdb59dae8e [2024-11-22 04:41:25,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 04:41:25,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 04:41:25,851 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 04:41:25,852 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 04:41:25,853 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 04:41:25,854 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c [2024-11-22 04:41:27,413 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 04:41:27,585 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 04:41:27,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c [2024-11-22 04:41:27,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d886b42/56f67a422e4241daa83b5bf6b34375ba/FLAGf23e6ca1f [2024-11-22 04:41:27,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64d886b42/56f67a422e4241daa83b5bf6b34375ba [2024-11-22 04:41:27,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 04:41:27,626 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 04:41:27,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 04:41:27,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 04:41:27,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 04:41:27,632 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:27,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8a3d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27, skipping insertion in model container [2024-11-22 04:41:27,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:27,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 04:41:27,839 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c[1245,1258] [2024-11-22 04:41:27,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 04:41:27,925 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 04:41:27,940 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal18.c[1245,1258] [2024-11-22 04:41:27,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 04:41:27,986 INFO L204 MainTranslator]: Completed translation [2024-11-22 04:41:27,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27 WrapperNode [2024-11-22 04:41:27,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 04:41:27,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 04:41:27,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 04:41:27,989 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 04:41:27,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,006 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,030 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 175 [2024-11-22 04:41:28,031 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 04:41:28,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 04:41:28,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 04:41:28,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 04:41:28,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,045 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,058 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-22 04:41:28,058 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,058 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,065 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,083 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 04:41:28,084 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 04:41:28,084 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 04:41:28,084 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 04:41:28,085 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (1/1) ... [2024-11-22 04:41:28,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 04:41:28,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 04:41:28,114 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 04:41:28,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 04:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 04:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 04:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 04:41:28,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 04:41:28,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 04:41:28,247 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 04:41:28,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 04:41:28,484 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-22 04:41:28,484 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 04:41:28,497 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 04:41:28,498 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 04:41:28,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:28 BoogieIcfgContainer [2024-11-22 04:41:28,498 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 04:41:28,500 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 04:41:28,500 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 04:41:28,503 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 04:41:28,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 04:41:27" (1/3) ... [2024-11-22 04:41:28,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b22205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:41:28, skipping insertion in model container [2024-11-22 04:41:28,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 04:41:27" (2/3) ... [2024-11-22 04:41:28,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b22205 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 04:41:28, skipping insertion in model container [2024-11-22 04:41:28,505 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:28" (3/3) ... [2024-11-22 04:41:28,506 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal18.c [2024-11-22 04:41:28,519 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 04:41:28,519 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 04:41:28,571 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 04:41:28,577 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;@20a63deb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 04:41:28,578 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 04:41:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 04:41:28,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:28,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 04:41:28,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:28,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 04:41:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 04:41:28,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544232319] [2024-11-22 04:41:28,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:28,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 04:41:28,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 04:41:28,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 04:41:28,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 04:41:28,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:28,731 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 04:41:28,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:41:28,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:28,861 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 04:41:28,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 04:41:28,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544232319] [2024-11-22 04:41:28,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544232319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 04:41:28,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 04:41:28,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 04:41:28,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651236148] [2024-11-22 04:41:28,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 04:41:28,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 04:41:28,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 04:41:28,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 04:41:28,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 04:41:28,888 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:28,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:28,934 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-22 04:41:28,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 04:41:28,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 04:41:28,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:28,941 INFO L225 Difference]: With dead ends: 18 [2024-11-22 04:41:28,942 INFO L226 Difference]: Without dead ends: 10 [2024-11-22 04:41:28,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 04:41:28,947 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:28,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:41:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-22 04:41:28,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-22 04:41:28,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:28,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 04:41:28,970 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 04:41:28,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:28,971 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 04:41:28,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:28,972 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 04:41:28,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 04:41:28,972 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:28,972 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 04:41:28,975 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 04:41:29,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 04:41:29,175 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:29,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:29,176 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 04:41:29,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 04:41:29,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273419294] [2024-11-22 04:41:29,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 04:41:29,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 04:41:29,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 04:41:29,180 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 04:41:29,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 04:41:29,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 04:41:29,288 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 04:41:29,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:41:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:29,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 04:41:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:30,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 04:41:30,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273419294] [2024-11-22 04:41:30,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273419294] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 04:41:30,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 04:41:30,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 04:41:30,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647786964] [2024-11-22 04:41:30,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 04:41:30,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 04:41:30,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 04:41:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 04:41:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 04:41:30,445 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:30,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:30,497 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-22 04:41:30,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 04:41:30,497 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 04:41:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:30,498 INFO L225 Difference]: With dead ends: 14 [2024-11-22 04:41:30,498 INFO L226 Difference]: Without dead ends: 12 [2024-11-22 04:41:30,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-22 04:41:30,499 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:30,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 04:41:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-22 04:41:30,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-22 04:41:30,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:30,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-22 04:41:30,502 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-22 04:41:30,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:30,502 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-22 04:41:30,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:30,502 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-22 04:41:30,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 04:41:30,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 04:41:30,503 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-22 04:41:30,516 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-11-22 04:41:30,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 04:41:30,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 04:41:30,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 04:41:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-22 04:41:30,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 04:41:30,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1435674438] [2024-11-22 04:41:30,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 04:41:30,705 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 04:41:30,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 04:41:30,708 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 04:41:30,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 (4)] Waiting until timeout for monitored process [2024-11-22 04:41:30,804 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 04:41:30,804 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 04:41:30,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 04:41:30,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 04:41:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:31,948 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 04:41:39,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 04:41:39,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 04:41:39,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1435674438] [2024-11-22 04:41:39,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1435674438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 04:41:39,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 04:41:39,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 04:41:39,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783141768] [2024-11-22 04:41:39,482 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 04:41:39,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 04:41:39,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 04:41:39,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 04:41:39,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-22 04:41:39,488 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:39,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 04:41:39,605 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-22 04:41:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 04:41:39,605 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 04:41:39,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 04:41:39,605 INFO L225 Difference]: With dead ends: 12 [2024-11-22 04:41:39,606 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 04:41:39,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-22 04:41:39,607 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 04:41:39,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 04:41:39,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 04:41:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 04:41:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 04:41:39,608 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-22 04:41:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 04:41:39,608 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 04:41:39,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 04:41:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 04:41:39,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 04:41:39,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 04:41:39,614 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 (4)] Forceful destruction successful, exit code 0 [2024-11-22 04:41:39,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 04:41:39,815 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-22 04:41:39,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-22 04:41:39,889 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 04:41:39,900 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-22 04:41:39,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 04:41:39 BoogieIcfgContainer [2024-11-22 04:41:39,912 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 04:41:39,912 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 04:41:39,912 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 04:41:39,912 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 04:41:39,913 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 04:41:28" (3/4) ... [2024-11-22 04:41:39,919 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 04:41:39,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-22 04:41:39,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-22 04:41:39,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-22 04:41:39,927 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 04:41:39,929 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 04:41:40,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 04:41:40,020 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 04:41:40,020 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 04:41:40,021 INFO L158 Benchmark]: Toolchain (without parser) took 12395.02ms. Allocated memory was 56.6MB in the beginning and 750.8MB in the end (delta: 694.2MB). Free memory was 28.6MB in the beginning and 685.3MB in the end (delta: -656.7MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,021 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 56.6MB. Free memory was 33.3MB in the beginning and 33.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 04:41:40,021 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.53ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 28.3MB in the beginning and 43.3MB in the end (delta: -15.0MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,021 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.06ms. Allocated memory is still 71.3MB. Free memory was 43.3MB in the beginning and 41.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,022 INFO L158 Benchmark]: Boogie Preprocessor took 51.30ms. Allocated memory is still 71.3MB. Free memory was 41.0MB in the beginning and 38.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,022 INFO L158 Benchmark]: RCFGBuilder took 414.89ms. Allocated memory is still 71.3MB. Free memory was 38.4MB in the beginning and 37.8MB in the end (delta: 610.2kB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,022 INFO L158 Benchmark]: TraceAbstraction took 11411.39ms. Allocated memory was 71.3MB in the beginning and 750.8MB in the end (delta: 679.5MB). Free memory was 37.4MB in the beginning and 691.6MB in the end (delta: -654.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,022 INFO L158 Benchmark]: Witness Printer took 108.01ms. Allocated memory is still 750.8MB. Free memory was 691.6MB in the beginning and 685.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 04:41:40,023 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.22ms. Allocated memory is still 56.6MB. Free memory was 33.3MB in the beginning and 33.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.53ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 28.3MB in the beginning and 43.3MB in the end (delta: -15.0MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.06ms. Allocated memory is still 71.3MB. Free memory was 43.3MB in the beginning and 41.0MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.30ms. Allocated memory is still 71.3MB. Free memory was 41.0MB in the beginning and 38.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 414.89ms. Allocated memory is still 71.3MB. Free memory was 38.4MB in the beginning and 37.8MB in the end (delta: 610.2kB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11411.39ms. Allocated memory was 71.3MB in the beginning and 750.8MB in the end (delta: 679.5MB). Free memory was 37.4MB in the beginning and 691.6MB in the end (delta: -654.2MB). Peak memory consumption was 21.5MB. Max. memory is 16.1GB. * Witness Printer took 108.01ms. Allocated memory is still 750.8MB. Free memory was 691.6MB in the beginning and 685.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 12 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 17, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 12 QuantifiedInterpolants, 9369 SizeOfPredicates, 23 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (0 == state_11)) && (1 == mask_SORT_1)) || (((((1 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) || (((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) RESULT: Ultimate proved your program to be correct! [2024-11-22 04:41:40,044 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 Writing output log to file Ultimate.log Result: TRUE