./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.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 f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:28:16,758 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:28:16,825 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-18 17:28:16,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:28:16,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:28:16,880 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:28:16,882 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:28:16,883 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:28:16,884 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:28:16,888 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:28:16,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:28:16,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:28:16,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:28:16,889 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:28:16,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:28:16,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:28:16,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:28:16,891 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 17:28:16,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:28:16,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:28:16,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:28:16,894 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:28:16,894 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:28:16,894 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:28:16,895 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:28:16,895 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:28:16,895 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:28:16,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:28:16,896 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:28:16,896 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:16,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:28:16,897 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:28:16,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:28:16,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 17:28:16,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 17:28:16,899 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:28:16,899 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:28:16,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:28:16,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:28:16,900 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 -> f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f [2024-11-18 17:28:17,151 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:28:17,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:28:17,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:28:17,178 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:28:17,179 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:28:17,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2024-11-18 17:28:18,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:28:18,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:28:18,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2024-11-18 17:28:18,787 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2932c58dc/63931303e2b249998375d45c752b8452/FLAG4e5d25ec9 [2024-11-18 17:28:18,808 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2932c58dc/63931303e2b249998375d45c752b8452 [2024-11-18 17:28:18,810 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:28:18,813 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:28:18,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:28:18,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:28:18,823 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:28:18,824 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:28:18" (1/1) ... [2024-11-18 17:28:18,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677e25df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:18, skipping insertion in model container [2024-11-18 17:28:18,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:28:18" (1/1) ... [2024-11-18 17:28:18,864 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:28:19,059 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.h_b08.c[1245,1258] [2024-11-18 17:28:19,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:28:19,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:28:19,213 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.h_b08.c[1245,1258] [2024-11-18 17:28:19,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:28:19,305 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:28:19,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19 WrapperNode [2024-11-18 17:28:19,306 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:28:19,307 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:19,307 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:28:19,307 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:28:19,314 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,402 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 486 [2024-11-18 17:28:19,403 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:19,404 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:28:19,404 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:28:19,404 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:28:19,419 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,436 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,474 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-18 17:28:19,475 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,475 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,502 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,510 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,519 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,534 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:28:19,539 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:28:19,539 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:28:19,539 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:28:19,540 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (1/1) ... [2024-11-18 17:28:19,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:19,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:19,574 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-18 17:28:19,577 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-18 17:28:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:28:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 17:28:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-18 17:28:19,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:28:19,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:28:19,759 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:28:19,761 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:28:20,342 INFO L? ?]: Removed 266 outVars from TransFormulas that were not future-live. [2024-11-18 17:28:20,343 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:28:20,360 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:28:20,360 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:28:20,361 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:20 BoogieIcfgContainer [2024-11-18 17:28:20,361 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:28:20,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:28:20,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:28:20,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:28:20,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:28:18" (1/3) ... [2024-11-18 17:28:20,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5821c298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:20, skipping insertion in model container [2024-11-18 17:28:20,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:19" (2/3) ... [2024-11-18 17:28:20,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5821c298 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:20, skipping insertion in model container [2024-11-18 17:28:20,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:20" (3/3) ... [2024-11-18 17:28:20,373 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b08.c [2024-11-18 17:28:20,395 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:28:20,395 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:28:20,455 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:28:20,461 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;@44376ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:28:20,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:28:20,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 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-18 17:28:20,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-18 17:28:20,471 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:20,471 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-18 17:28:20,472 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:20,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:20,477 INFO L85 PathProgramCache]: Analyzing trace with hash -410280839, now seen corresponding path program 1 times [2024-11-18 17:28:20,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:20,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686649155] [2024-11-18 17:28:20,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:20,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:28,547 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-18 17:28:28,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:28,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686649155] [2024-11-18 17:28:28,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686649155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:28,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:28,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 17:28:28,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962654754] [2024-11-18 17:28:28,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:28,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 17:28:28,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:28,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 17:28:28,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-18 17:28:28,590 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 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 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-18 17:28:29,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:29,448 INFO L93 Difference]: Finished difference Result 119 states and 174 transitions. [2024-11-18 17:28:29,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 17:28:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-18 17:28:29,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:29,461 INFO L225 Difference]: With dead ends: 119 [2024-11-18 17:28:29,462 INFO L226 Difference]: Without dead ends: 63 [2024-11-18 17:28:29,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2024-11-18 17:28:29,473 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 196 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:29,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 526 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:29,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-18 17:28:29,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-18 17:28:29,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 62 states have internal predecessors, (90), 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-18 17:28:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 90 transitions. [2024-11-18 17:28:29,506 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 90 transitions. Word has length 31 [2024-11-18 17:28:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:29,507 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 90 transitions. [2024-11-18 17:28:29,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 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-18 17:28:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 90 transitions. [2024-11-18 17:28:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-18 17:28:29,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:29,510 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-18 17:28:29,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 17:28:29,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:29,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:29,511 INFO L85 PathProgramCache]: Analyzing trace with hash 2065230671, now seen corresponding path program 1 times [2024-11-18 17:28:29,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:29,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158353015] [2024-11-18 17:28:29,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:29,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:29,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:29,823 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-18 17:28:29,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:29,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158353015] [2024-11-18 17:28:29,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158353015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:29,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:29,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:29,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038141217] [2024-11-18 17:28:29,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:29,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:29,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:29,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:29,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:29,829 INFO L87 Difference]: Start difference. First operand 63 states and 90 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-18 17:28:29,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:29,856 INFO L93 Difference]: Finished difference Result 67 states and 94 transitions. [2024-11-18 17:28:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:29,857 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-11-18 17:28:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:29,859 INFO L225 Difference]: With dead ends: 67 [2024-11-18 17:28:29,859 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 17:28:29,860 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-18 17:28:29,862 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 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.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:29,863 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:29,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 17:28:29,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-18 17:28:29,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.4375) internal successors, (92), 64 states have internal predecessors, (92), 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-18 17:28:29,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2024-11-18 17:28:29,875 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 32 [2024-11-18 17:28:29,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:29,876 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2024-11-18 17:28:29,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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-18 17:28:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2024-11-18 17:28:29,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-18 17:28:29,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:29,880 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, 1] [2024-11-18 17:28:29,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 17:28:29,881 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:29,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:29,881 INFO L85 PathProgramCache]: Analyzing trace with hash -400663317, now seen corresponding path program 1 times [2024-11-18 17:28:29,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:29,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917672942] [2024-11-18 17:28:29,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:29,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:30,090 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-18 17:28:30,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:30,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917672942] [2024-11-18 17:28:30,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917672942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:30,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:30,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:30,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053116515] [2024-11-18 17:28:30,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:30,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:30,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:30,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:30,096 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-18 17:28:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:30,124 INFO L93 Difference]: Finished difference Result 122 states and 173 transitions. [2024-11-18 17:28:30,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:30,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-18 17:28:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:30,126 INFO L225 Difference]: With dead ends: 122 [2024-11-18 17:28:30,126 INFO L226 Difference]: Without dead ends: 67 [2024-11-18 17:28:30,127 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-18 17:28:30,128 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 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-18 17:28:30,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:30,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-18 17:28:30,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-18 17:28:30,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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-18 17:28:30,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-11-18 17:28:30,134 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 33 [2024-11-18 17:28:30,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:30,134 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-11-18 17:28:30,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 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-18 17:28:30,135 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-11-18 17:28:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-18 17:28:30,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:30,136 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, 1, 1] [2024-11-18 17:28:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 17:28:30,136 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:30,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:30,137 INFO L85 PathProgramCache]: Analyzing trace with hash -633626712, now seen corresponding path program 1 times [2024-11-18 17:28:30,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:30,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746528516] [2024-11-18 17:28:30,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:30,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:30,443 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-18 17:28:30,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:30,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746528516] [2024-11-18 17:28:30,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746528516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:30,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:30,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:28:30,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834549578] [2024-11-18 17:28:30,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:30,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:28:30,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:30,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:28:30,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:28:30,446 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-18 17:28:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:30,483 INFO L93 Difference]: Finished difference Result 122 states and 172 transitions. [2024-11-18 17:28:30,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:30,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 34 [2024-11-18 17:28:30,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:30,485 INFO L225 Difference]: With dead ends: 122 [2024-11-18 17:28:30,485 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 17:28:30,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:28:30,486 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 65 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:30,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 246 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:30,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 17:28:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-18 17:28:30,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.40625) internal successors, (90), 64 states have internal predecessors, (90), 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-18 17:28:30,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 90 transitions. [2024-11-18 17:28:30,499 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 90 transitions. Word has length 34 [2024-11-18 17:28:30,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:30,500 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 90 transitions. [2024-11-18 17:28:30,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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-18 17:28:30,500 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2024-11-18 17:28:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-18 17:28:30,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:30,502 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, 1, 1, 1] [2024-11-18 17:28:30,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 17:28:30,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:30,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:30,503 INFO L85 PathProgramCache]: Analyzing trace with hash -898013618, now seen corresponding path program 1 times [2024-11-18 17:28:30,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:30,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19076534] [2024-11-18 17:28:30,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:30,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:36,404 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-18 17:28:36,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:28:36,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19076534] [2024-11-18 17:28:36,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19076534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:36,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:36,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-18 17:28:36,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988528245] [2024-11-18 17:28:36,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:36,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 17:28:36,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:28:36,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 17:28:36,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-18 17:28:36,407 INFO L87 Difference]: Start difference. First operand 65 states and 90 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-18 17:28:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:37,167 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-11-18 17:28:37,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 17:28:37,167 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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 35 [2024-11-18 17:28:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:37,168 INFO L225 Difference]: With dead ends: 120 [2024-11-18 17:28:37,168 INFO L226 Difference]: Without dead ends: 65 [2024-11-18 17:28:37,169 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2024-11-18 17:28:37,170 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 190 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:37,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 445 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:28:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-18 17:28:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-18 17:28:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.390625) internal successors, (89), 64 states have internal predecessors, (89), 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-18 17:28:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 89 transitions. [2024-11-18 17:28:37,178 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 89 transitions. Word has length 35 [2024-11-18 17:28:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:37,178 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 89 transitions. [2024-11-18 17:28:37,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 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-18 17:28:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 89 transitions. [2024-11-18 17:28:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-18 17:28:37,184 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:37,184 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, 1, 1, 1, 1] [2024-11-18 17:28:37,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 17:28:37,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:37,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:37,185 INFO L85 PathProgramCache]: Analyzing trace with hash -450530713, now seen corresponding path program 1 times [2024-11-18 17:28:37,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:28:37,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903206199] [2024-11-18 17:28:37,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:37,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:28:37,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:28:37,320 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 17:28:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:28:37,442 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 17:28:37,443 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 17:28:37,444 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:28:37,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 17:28:37,449 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-18 17:28:37,517 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:28:37,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:28:37 BoogieIcfgContainer [2024-11-18 17:28:37,520 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:28:37,521 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:28:37,521 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:28:37,521 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:28:37,522 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:20" (3/4) ... [2024-11-18 17:28:37,524 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 17:28:37,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:28:37,526 INFO L158 Benchmark]: Toolchain (without parser) took 18713.12ms. Allocated memory was 159.4MB in the beginning and 752.9MB in the end (delta: 593.5MB). Free memory was 114.0MB in the beginning and 539.6MB in the end (delta: -425.6MB). Peak memory consumption was 170.0MB. Max. memory is 16.1GB. [2024-11-18 17:28:37,526 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 159.4MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:28:37,527 INFO L158 Benchmark]: CACSL2BoogieTranslator took 489.33ms. Allocated memory is still 159.4MB. Free memory was 114.0MB in the beginning and 93.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-18 17:28:37,527 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.45ms. Allocated memory is still 159.4MB. Free memory was 93.8MB in the beginning and 86.7MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 17:28:37,527 INFO L158 Benchmark]: Boogie Preprocessor took 134.32ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 81.2MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-18 17:28:37,528 INFO L158 Benchmark]: RCFGBuilder took 822.17ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 81.2MB in the beginning and 191.5MB in the end (delta: -110.3MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2024-11-18 17:28:37,528 INFO L158 Benchmark]: TraceAbstraction took 17155.13ms. Allocated memory was 234.9MB in the beginning and 752.9MB in the end (delta: 518.0MB). Free memory was 191.5MB in the beginning and 539.6MB in the end (delta: -348.1MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. [2024-11-18 17:28:37,528 INFO L158 Benchmark]: Witness Printer took 4.44ms. Allocated memory is still 752.9MB. Free memory is still 539.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:28:37,532 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 159.4MB. Free memory is still 127.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 489.33ms. Allocated memory is still 159.4MB. Free memory was 114.0MB in the beginning and 93.8MB in the end (delta: 20.2MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.45ms. Allocated memory is still 159.4MB. Free memory was 93.8MB in the beginning and 86.7MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 134.32ms. Allocated memory is still 159.4MB. Free memory was 86.7MB in the beginning and 81.2MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 822.17ms. Allocated memory was 159.4MB in the beginning and 234.9MB in the end (delta: 75.5MB). Free memory was 81.2MB in the beginning and 191.5MB in the end (delta: -110.3MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17155.13ms. Allocated memory was 234.9MB in the beginning and 752.9MB in the end (delta: 518.0MB). Free memory was 191.5MB in the beginning and 539.6MB in the end (delta: -348.1MB). Peak memory consumption was 168.8MB. Max. memory is 16.1GB. * Witness Printer took 4.44ms. Allocated memory is still 752.9MB. Free memory is still 539.6MB. 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 bitwiseAnd at line 298. 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_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 20); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (20 - 1); [L35] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 3); [L36] const SORT_9 msb_SORT_9 = (SORT_9)1 << (3 - 1); [L38] const SORT_13 mask_SORT_13 = (SORT_13)-1 >> (sizeof(SORT_13) * 8 - 32); [L39] const SORT_13 msb_SORT_13 = (SORT_13)1 << (32 - 1); [L41] const SORT_90 mask_SORT_90 = (SORT_90)-1 >> (sizeof(SORT_90) * 8 - 4); [L42] const SORT_90 msb_SORT_90 = (SORT_90)1 << (4 - 1); [L44] const SORT_6 var_7 = 196596; [L45] const SORT_6 var_8 = 829275; [L46] const SORT_9 var_10 = 0; [L47] const SORT_13 var_15 = 6; [L48] const SORT_13 var_20 = 5; [L49] const SORT_13 var_25 = 4; [L50] const SORT_13 var_30 = 3; [L51] const SORT_13 var_35 = 2; [L52] const SORT_13 var_40 = 1; [L53] const SORT_13 var_45 = 0; [L54] const SORT_6 var_48 = 1047464; [L55] const SORT_6 var_60 = 1048430; [L56] const SORT_6 var_70 = 1046202; [L57] const SORT_6 var_78 = 692223; [L58] const SORT_6 var_84 = 236898; [L59] const SORT_6 var_88 = 522618; [L60] const SORT_1 var_96 = 1; [L61] const SORT_1 var_107 = 0; [L63] SORT_1 input_2; [L64] SORT_3 input_4; [L65] SORT_1 input_5; [L66] SORT_6 input_18; [L67] SORT_6 input_23; [L68] SORT_6 input_28; [L69] SORT_6 input_33; [L70] SORT_6 input_38; [L71] SORT_6 input_43; [L72] SORT_6 input_50; [L73] SORT_6 input_52; [L74] SORT_6 input_54; [L75] SORT_6 input_56; [L76] SORT_6 input_58; [L77] SORT_6 input_62; [L78] SORT_6 input_64; [L79] SORT_6 input_66; [L80] SORT_6 input_68; [L81] SORT_6 input_72; [L82] SORT_6 input_74; [L83] SORT_6 input_76; [L84] SORT_6 input_80; [L85] SORT_6 input_82; [L86] SORT_6 input_86; [L87] SORT_3 input_100; [L88] SORT_90 input_102; [L89] SORT_90 input_104; [L90] SORT_1 input_113; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L92] SORT_9 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L93] SORT_1 state_108 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] SORT_9 init_12_arg_1 = var_10; [L96] state_11 = init_12_arg_1 [L97] SORT_1 init_109_arg_1 = var_107; [L98] state_108 = init_109_arg_1 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L101] input_2 = __VERIFIER_nondet_uchar() [L102] input_4 = __VERIFIER_nondet_uchar() [L103] input_5 = __VERIFIER_nondet_uchar() [L104] EXPR input_5 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L104] input_5 = input_5 & mask_SORT_1 [L105] input_18 = __VERIFIER_nondet_uint() [L106] input_23 = __VERIFIER_nondet_uint() [L107] input_28 = __VERIFIER_nondet_uint() [L108] input_33 = __VERIFIER_nondet_uint() [L109] input_38 = __VERIFIER_nondet_uint() [L110] input_43 = __VERIFIER_nondet_uint() [L111] input_50 = __VERIFIER_nondet_uint() [L112] input_52 = __VERIFIER_nondet_uint() [L113] input_54 = __VERIFIER_nondet_uint() [L114] input_56 = __VERIFIER_nondet_uint() [L115] input_58 = __VERIFIER_nondet_uint() [L116] input_62 = __VERIFIER_nondet_uint() [L117] input_64 = __VERIFIER_nondet_uint() [L118] input_66 = __VERIFIER_nondet_uint() [L119] input_68 = __VERIFIER_nondet_uint() [L120] input_72 = __VERIFIER_nondet_uint() [L121] input_74 = __VERIFIER_nondet_uint() [L122] input_76 = __VERIFIER_nondet_uint() [L123] input_80 = __VERIFIER_nondet_uint() [L124] input_82 = __VERIFIER_nondet_uint() [L125] input_86 = __VERIFIER_nondet_uint() [L126] input_100 = __VERIFIER_nondet_uchar() [L127] input_102 = __VERIFIER_nondet_uchar() [L128] input_104 = __VERIFIER_nondet_uchar() [L129] input_113 = __VERIFIER_nondet_uchar() [L132] SORT_9 var_44_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_44_arg_0=0, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L133] EXPR var_44_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L133] var_44_arg_0 = var_44_arg_0 & mask_SORT_9 [L134] SORT_13 var_44 = var_44_arg_0; [L135] SORT_13 var_46_arg_0 = var_44; [L136] SORT_13 var_46_arg_1 = var_45; [L137] SORT_1 var_46 = var_46_arg_0 == var_46_arg_1; [L138] SORT_9 var_39_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_39_arg_0=0, var_40=1, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L139] EXPR var_39_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L139] var_39_arg_0 = var_39_arg_0 & mask_SORT_9 [L140] SORT_13 var_39 = var_39_arg_0; [L141] SORT_13 var_41_arg_0 = var_39; [L142] SORT_13 var_41_arg_1 = var_40; [L143] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L144] SORT_9 var_34_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_34_arg_0=0, var_35=2, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L145] EXPR var_34_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L145] var_34_arg_0 = var_34_arg_0 & mask_SORT_9 [L146] SORT_13 var_34 = var_34_arg_0; [L147] SORT_13 var_36_arg_0 = var_34; [L148] SORT_13 var_36_arg_1 = var_35; [L149] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L150] SORT_9 var_29_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_29_arg_0=0, var_30=3, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L151] EXPR var_29_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L151] var_29_arg_0 = var_29_arg_0 & mask_SORT_9 [L152] SORT_13 var_29 = var_29_arg_0; [L153] SORT_13 var_31_arg_0 = var_29; [L154] SORT_13 var_31_arg_1 = var_30; [L155] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L156] SORT_9 var_24_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_24_arg_0=0, var_25=4, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L157] EXPR var_24_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L157] var_24_arg_0 = var_24_arg_0 & mask_SORT_9 [L158] SORT_13 var_24 = var_24_arg_0; [L159] SORT_13 var_26_arg_0 = var_24; [L160] SORT_13 var_26_arg_1 = var_25; [L161] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L162] SORT_9 var_19_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_19_arg_0=0, var_20=5, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L163] EXPR var_19_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L163] var_19_arg_0 = var_19_arg_0 & mask_SORT_9 [L164] SORT_13 var_19 = var_19_arg_0; [L165] SORT_13 var_21_arg_0 = var_19; [L166] SORT_13 var_21_arg_1 = var_20; [L167] SORT_1 var_21 = var_21_arg_0 == var_21_arg_1; [L168] SORT_9 var_14_arg_0 = state_11; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_14_arg_0=0, var_15=6, var_20=5, var_21=0, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L169] EXPR var_14_arg_0 & mask_SORT_9 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_21=0, var_25=4, var_26=0, var_30=3, var_31=0, var_35=2, var_36=0, var_40=1, var_41=0, var_45=0, var_46=1, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L169] var_14_arg_0 = var_14_arg_0 & mask_SORT_9 [L170] SORT_13 var_14 = var_14_arg_0; [L171] SORT_13 var_16_arg_0 = var_14; [L172] SORT_13 var_16_arg_1 = var_15; [L173] SORT_1 var_16 = var_16_arg_0 == var_16_arg_1; [L174] SORT_1 var_17_arg_0 = var_16; [L175] SORT_6 var_17_arg_1 = var_8; [L176] SORT_6 var_17_arg_2 = var_7; [L177] SORT_6 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; [L178] SORT_1 var_22_arg_0 = var_21; [L179] SORT_6 var_22_arg_1 = input_18; [L180] SORT_6 var_22_arg_2 = var_17; [L181] SORT_6 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; [L182] SORT_1 var_27_arg_0 = var_26; [L183] SORT_6 var_27_arg_1 = input_23; [L184] SORT_6 var_27_arg_2 = var_22; [L185] SORT_6 var_27 = var_27_arg_0 ? var_27_arg_1 : var_27_arg_2; [L186] SORT_1 var_32_arg_0 = var_31; [L187] SORT_6 var_32_arg_1 = input_28; [L188] SORT_6 var_32_arg_2 = var_27; [L189] SORT_6 var_32 = var_32_arg_0 ? var_32_arg_1 : var_32_arg_2; [L190] SORT_1 var_37_arg_0 = var_36; [L191] SORT_6 var_37_arg_1 = input_33; [L192] SORT_6 var_37_arg_2 = var_32; [L193] SORT_6 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L194] SORT_1 var_42_arg_0 = var_41; [L195] SORT_6 var_42_arg_1 = input_38; [L196] SORT_6 var_42_arg_2 = var_37; [L197] SORT_6 var_42 = var_42_arg_0 ? var_42_arg_1 : var_42_arg_2; [L198] SORT_1 var_47_arg_0 = var_46; [L199] SORT_6 var_47_arg_1 = input_43; [L200] SORT_6 var_47_arg_2 = var_42; [L201] SORT_6 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L202] SORT_1 var_49_arg_0 = var_21; [L203] SORT_6 var_49_arg_1 = var_48; [L204] SORT_6 var_49_arg_2 = var_47; [L205] SORT_6 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L206] SORT_1 var_51_arg_0 = var_26; [L207] SORT_6 var_51_arg_1 = input_50; [L208] SORT_6 var_51_arg_2 = var_49; [L209] SORT_6 var_51 = var_51_arg_0 ? var_51_arg_1 : var_51_arg_2; [L210] SORT_1 var_53_arg_0 = var_31; [L211] SORT_6 var_53_arg_1 = input_52; [L212] SORT_6 var_53_arg_2 = var_51; [L213] SORT_6 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L214] SORT_1 var_55_arg_0 = var_36; [L215] SORT_6 var_55_arg_1 = input_54; [L216] SORT_6 var_55_arg_2 = var_53; [L217] SORT_6 var_55 = var_55_arg_0 ? var_55_arg_1 : var_55_arg_2; [L218] SORT_1 var_57_arg_0 = var_41; [L219] SORT_6 var_57_arg_1 = input_56; [L220] SORT_6 var_57_arg_2 = var_55; [L221] SORT_6 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L222] SORT_1 var_59_arg_0 = var_46; [L223] SORT_6 var_59_arg_1 = input_58; [L224] SORT_6 var_59_arg_2 = var_57; [L225] SORT_6 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L226] SORT_1 var_61_arg_0 = var_26; [L227] SORT_6 var_61_arg_1 = var_60; [L228] SORT_6 var_61_arg_2 = var_59; [L229] SORT_6 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L230] SORT_1 var_63_arg_0 = var_31; [L231] SORT_6 var_63_arg_1 = input_62; [L232] SORT_6 var_63_arg_2 = var_61; [L233] SORT_6 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L234] SORT_1 var_65_arg_0 = var_36; [L235] SORT_6 var_65_arg_1 = input_64; [L236] SORT_6 var_65_arg_2 = var_63; [L237] SORT_6 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L238] SORT_1 var_67_arg_0 = var_41; [L239] SORT_6 var_67_arg_1 = input_66; [L240] SORT_6 var_67_arg_2 = var_65; [L241] SORT_6 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L242] SORT_1 var_69_arg_0 = var_46; [L243] SORT_6 var_69_arg_1 = input_68; [L244] SORT_6 var_69_arg_2 = var_67; [L245] SORT_6 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L246] SORT_1 var_71_arg_0 = var_31; [L247] SORT_6 var_71_arg_1 = var_70; [L248] SORT_6 var_71_arg_2 = var_69; [L249] SORT_6 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L250] SORT_1 var_73_arg_0 = var_36; [L251] SORT_6 var_73_arg_1 = input_72; [L252] SORT_6 var_73_arg_2 = var_71; [L253] SORT_6 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L254] SORT_1 var_75_arg_0 = var_41; [L255] SORT_6 var_75_arg_1 = input_74; [L256] SORT_6 var_75_arg_2 = var_73; [L257] SORT_6 var_75 = var_75_arg_0 ? var_75_arg_1 : var_75_arg_2; [L258] SORT_1 var_77_arg_0 = var_46; [L259] SORT_6 var_77_arg_1 = input_76; [L260] SORT_6 var_77_arg_2 = var_75; [L261] SORT_6 var_77 = var_77_arg_0 ? var_77_arg_1 : var_77_arg_2; [L262] SORT_1 var_79_arg_0 = var_36; [L263] SORT_6 var_79_arg_1 = var_78; [L264] SORT_6 var_79_arg_2 = var_77; [L265] SORT_6 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L266] SORT_1 var_81_arg_0 = var_41; [L267] SORT_6 var_81_arg_1 = input_80; [L268] SORT_6 var_81_arg_2 = var_79; [L269] SORT_6 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L270] SORT_1 var_83_arg_0 = var_46; [L271] SORT_6 var_83_arg_1 = input_82; [L272] SORT_6 var_83_arg_2 = var_81; [L273] SORT_6 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L274] SORT_1 var_85_arg_0 = var_41; [L275] SORT_6 var_85_arg_1 = var_84; [L276] SORT_6 var_85_arg_2 = var_83; [L277] SORT_6 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L278] SORT_1 var_87_arg_0 = var_46; [L279] SORT_6 var_87_arg_1 = input_86; [L280] SORT_6 var_87_arg_2 = var_85; [L281] SORT_6 var_87 = var_87_arg_0 ? var_87_arg_1 : var_87_arg_2; [L282] SORT_1 var_89_arg_0 = var_46; [L283] SORT_6 var_89_arg_1 = var_88; [L284] SORT_6 var_89_arg_2 = var_87; [L285] SORT_6 var_89 = var_89_arg_0 ? var_89_arg_1 : var_89_arg_2; [L286] SORT_6 var_91_arg_0 = var_89; [L287] SORT_90 var_91 = var_91_arg_0 >> 0; [L288] SORT_90 var_92_arg_0 = var_91; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_92_arg_0=522618, var_96=1] [L289] EXPR var_92_arg_0 & mask_SORT_90 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L289] var_92_arg_0 = var_92_arg_0 & mask_SORT_90 [L290] SORT_13 var_92 = var_92_arg_0; [L291] SORT_13 var_93_arg_0 = var_92; [L292] SORT_13 var_93_arg_1 = var_45; [L293] SORT_1 var_93 = var_93_arg_0 != var_93_arg_1; [L294] SORT_1 var_97_arg_0 = var_93; [L295] SORT_1 var_97 = ~var_97_arg_0; [L296] SORT_1 var_98_arg_0 = var_96; [L297] SORT_1 var_98_arg_1 = var_97; VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1, var_98_arg_0=1, var_98_arg_1=-2] [L298] EXPR var_98_arg_0 & var_98_arg_1 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L298] SORT_1 var_98 = var_98_arg_0 & var_98_arg_1; [L299] EXPR var_98 & mask_SORT_1 VAL [input_5=0, mask_SORT_1=1, mask_SORT_90=15, mask_SORT_9=7, state_108=0, state_11=0, var_107=0, var_10=0, var_15=6, var_20=5, var_25=4, var_30=3, var_35=2, var_40=1, var_45=0, var_48=1047464, var_60=1048430, var_70=1046202, var_78=692223, var_7=196596, var_84=236898, var_88=522618, var_8=829275, var_96=1] [L299] var_98 = var_98 & mask_SORT_1 [L300] SORT_1 bad_99_arg_0 = var_98; [L301] CALL __VERIFIER_assert(!(bad_99_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.0s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 451 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 451 mSDsluCounter, 1729 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1302 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 153 IncrementalHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 427 mSDtfsCounter, 153 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, InterpolantAutomatonStates: 32, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 201 NumberOfCodeBlocks, 201 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 3086 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-18 17:28:37,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.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 f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:28:39,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:28:40,023 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-18 17:28:40,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:28:40,030 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:28:40,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:28:40,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:28:40,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:28:40,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:28:40,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:28:40,066 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:28:40,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:28:40,070 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:28:40,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:28:40,073 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:28:40,074 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:28:40,074 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:28:40,074 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:28:40,075 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:28:40,075 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:28:40,078 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:28:40,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 17:28:40,079 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 17:28:40,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:28:40,079 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 17:28:40,079 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:28:40,080 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:28:40,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:28:40,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:28:40,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:28:40,081 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:28:40,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:40,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:28:40,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:28:40,082 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:28:40,082 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 17:28:40,082 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 17:28:40,083 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:28:40,083 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:28:40,084 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:28:40,084 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:28:40,084 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 -> f849895f3b33bb52cfb29e0d9e7838b143b412485c8add4ec69cb2104446783f [2024-11-18 17:28:40,430 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:28:40,454 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:28:40,459 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:28:40,460 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:28:40,460 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:28:40,462 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2024-11-18 17:28:42,019 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:28:42,264 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:28:42,264 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b08.c [2024-11-18 17:28:42,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3e86840/fcca26326b2a42c989f2539d8adaf36e/FLAG6ef6f157a [2024-11-18 17:28:42,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7f3e86840/fcca26326b2a42c989f2539d8adaf36e [2024-11-18 17:28:42,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:28:42,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:28:42,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:28:42,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:28:42,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:28:42,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3942e669 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42, skipping insertion in model container [2024-11-18 17:28:42,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,349 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:28:42,553 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.h_b08.c[1245,1258] [2024-11-18 17:28:42,690 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:28:42,707 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:28:42,718 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.h_b08.c[1245,1258] [2024-11-18 17:28:42,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:28:42,771 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:28:42,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42 WrapperNode [2024-11-18 17:28:42,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:28:42,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:42,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:28:42,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:28:42,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,792 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,833 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 374 [2024-11-18 17:28:42,833 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:28:42,834 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:28:42,834 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:28:42,834 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:28:42,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,852 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,868 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-18 17:28:42,869 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,869 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,885 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,896 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,897 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:28:42,902 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:28:42,902 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:28:42,903 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:28:42,903 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (1/1) ... [2024-11-18 17:28:42,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:28:42,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:28:42,939 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-18 17:28:42,942 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-18 17:28:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:28:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 17:28:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-18 17:28:42,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:28:42,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:28:43,145 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:28:43,147 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:28:43,530 INFO L? ?]: Removed 199 outVars from TransFormulas that were not future-live. [2024-11-18 17:28:43,530 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:28:43,543 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:28:43,543 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:28:43,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:43 BoogieIcfgContainer [2024-11-18 17:28:43,544 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:28:43,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:28:43,546 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:28:43,550 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:28:43,550 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:28:42" (1/3) ... [2024-11-18 17:28:43,551 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24345a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:43, skipping insertion in model container [2024-11-18 17:28:43,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:28:42" (2/3) ... [2024-11-18 17:28:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24345a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:28:43, skipping insertion in model container [2024-11-18 17:28:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:43" (3/3) ... [2024-11-18 17:28:43,554 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b08.c [2024-11-18 17:28:43,570 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:28:43,571 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:28:43,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:28:43,638 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;@398f3ea6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:28:43,638 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:28:43,642 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-18 17:28:43,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-18 17:28:43,648 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:43,648 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-18 17:28:43,649 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:43,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:43,655 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-18 17:28:43,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:28:43,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36861687] [2024-11-18 17:28:43,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:43,672 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-18 17:28:43,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:28:43,675 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-18 17:28:43,676 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-18 17:28:43,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:43,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-18 17:28:43,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:44,369 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-18 17:28:44,370 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 17:28:44,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:28:44,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36861687] [2024-11-18 17:28:44,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36861687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:28:44,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:28:44,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:28:44,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161522397] [2024-11-18 17:28:44,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:28:44,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:28:44,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:28:44,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:28:44,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:28:44,404 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-18 17:28:44,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:44,501 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-18 17:28:44,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:44,505 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-18 17:28:44,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:44,512 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:28:44,512 INFO L226 Difference]: Without dead ends: 10 [2024-11-18 17:28:44,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:28:44,519 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:44,522 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.1s Time] [2024-11-18 17:28:44,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-18 17:28:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-18 17:28:44,548 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-18 17:28:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-18 17:28:44,550 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-18 17:28:44,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:44,550 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-18 17:28:44,551 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-18 17:28:44,551 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-18 17:28:44,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 17:28:44,552 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:44,552 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-18 17:28:44,559 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 (2)] Forceful destruction successful, exit code 0 [2024-11-18 17:28:44,756 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-18 17:28:44,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:44,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:44,759 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-18 17:28:44,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:28:44,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1624003008] [2024-11-18 17:28:44,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:28:44,761 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-18 17:28:44,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:28:44,764 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-18 17:28:44,766 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-18 17:28:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:28:45,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 385 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-18 17:28:45,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:45,555 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-18 17:28:45,555 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:46,398 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-18 17:28:46,398 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:28:46,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1624003008] [2024-11-18 17:28:46,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1624003008] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:46,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:28:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-18 17:28:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505703435] [2024-11-18 17:28:46,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:46,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-18 17:28:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:28:46,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-18 17:28:46,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:28:46,404 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-18 17:28:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:46,807 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-18 17:28:46,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-18 17:28:46,808 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-18 17:28:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:46,809 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:28:46,809 INFO L226 Difference]: Without dead ends: 16 [2024-11-18 17:28:46,810 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2024-11-18 17:28:46,811 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:46,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-18 17:28:46,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-18 17:28:46,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-18 17:28:46,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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-18 17:28:46,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-18 17:28:46,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-18 17:28:46,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:46,819 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-18 17:28:46,819 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-18 17:28:46,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-18 17:28:46,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 17:28:46,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:28:46,820 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-18 17:28:46,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 17:28:47,024 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-18 17:28:47,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:28:47,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:28:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-18 17:28:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:28:47,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1578702160] [2024-11-18 17:28:47,027 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:28:47,027 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-18 17:28:47,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:28:47,030 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-18 17:28:47,034 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-18 17:28:47,372 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-18 17:28:47,372 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:28:47,378 WARN L253 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 116 conjuncts are in the unsatisfiable core [2024-11-18 17:28:47,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:28:51,199 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 17:28:51,200 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:28:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-18 17:28:55,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:28:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1578702160] [2024-11-18 17:28:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1578702160] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:28:55,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:28:55,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2024-11-18 17:28:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458246211] [2024-11-18 17:28:55,380 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:28:55,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 17:28:55,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:28:55,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 17:28:55,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:28:55,382 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 17:28:55,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:28:55,445 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-18 17:28:55,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:28:55,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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 14 [2024-11-18 17:28:55,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:28:55,446 INFO L225 Difference]: With dead ends: 15 [2024-11-18 17:28:55,447 INFO L226 Difference]: Without dead ends: 0 [2024-11-18 17:28:55,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-18 17:28:55,448 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:28:55,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:28:55,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-18 17:28:55,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-18 17:28:55,450 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-18 17:28:55,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-18 17:28:55,450 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-11-18 17:28:55,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:28:55,450 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-18 17:28:55,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 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-18 17:28:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-18 17:28:55,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-18 17:28:55,454 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:28:55,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-18 17:28:55,655 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-18 17:28:55,658 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-18 17:28:55,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-18 17:28:55,770 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:28:55,784 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:28:55 BoogieIcfgContainer [2024-11-18 17:28:55,784 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:28:55,785 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:28:55,785 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:28:55,785 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:28:55,788 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:28:43" (3/4) ... [2024-11-18 17:28:55,791 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-18 17:28:55,804 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-18 17:28:55,804 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-18 17:28:55,805 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-18 17:28:55,806 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 17:28:55,806 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-18 17:28:55,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-18 17:28:55,939 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-18 17:28:55,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:28:55,940 INFO L158 Benchmark]: Toolchain (without parser) took 13637.61ms. Allocated memory was 69.2MB in the beginning and 388.0MB in the end (delta: 318.8MB). Free memory was 40.5MB in the beginning and 193.8MB in the end (delta: -153.3MB). Peak memory consumption was 165.2MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,940 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:28:55,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.48ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: -25.8kB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.58ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 37.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,941 INFO L158 Benchmark]: Boogie Preprocessor took 67.51ms. Allocated memory is still 69.2MB. Free memory was 37.0MB in the beginning and 33.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,942 INFO L158 Benchmark]: RCFGBuilder took 641.66ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 33.2MB in the beginning and 62.3MB in the end (delta: -29.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,942 INFO L158 Benchmark]: TraceAbstraction took 12238.03ms. Allocated memory was 96.5MB in the beginning and 388.0MB in the end (delta: 291.5MB). Free memory was 61.3MB in the beginning and 203.2MB in the end (delta: -141.9MB). Peak memory consumption was 149.5MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,942 INFO L158 Benchmark]: Witness Printer took 154.64ms. Allocated memory is still 388.0MB. Free memory was 203.2MB in the beginning and 193.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-18 17:28:55,944 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.12ms. Allocated memory is still 50.3MB. Free memory was 31.2MB in the beginning and 31.1MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.48ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 40.3MB in the end (delta: -25.8kB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.58ms. Allocated memory is still 69.2MB. Free memory was 40.3MB in the beginning and 37.0MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.51ms. Allocated memory is still 69.2MB. Free memory was 37.0MB in the beginning and 33.2MB in the end (delta: 3.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 641.66ms. Allocated memory was 69.2MB in the beginning and 96.5MB in the end (delta: 27.3MB). Free memory was 33.2MB in the beginning and 62.3MB in the end (delta: -29.1MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 12238.03ms. Allocated memory was 96.5MB in the beginning and 388.0MB in the end (delta: 291.5MB). Free memory was 61.3MB in the beginning and 203.2MB in the end (delta: -141.9MB). Peak memory consumption was 149.5MB. Max. memory is 16.1GB. * Witness Printer took 154.64ms. Allocated memory is still 388.0MB. Free memory was 203.2MB in the beginning and 193.8MB in the end (delta: 9.4MB). Peak memory consumption was 8.4MB. 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 - 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: 12.0s, OverallIterations: 3, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 31 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 10 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 50 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=2, InterpolantAutomatonStates: 16, 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, 2 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 9.7s InterpolantComputationTime, 27 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 44 ConstructedInterpolants, 14 QuantifiedInterpolants, 5236 SizeOfPredicates, 26 NumberOfNonLiveVariables, 823 ConjunctsInSsa, 182 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 24/34 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: 99]: Loop Invariant Derived loop invariant: (((((((((((1046202 == var_70) && (196596 == var_7)) && (522618 == var_88)) && (1047464 == var_48)) && (0 == var_45)) && (692223 == var_78)) && (15 == mask_SORT_90)) && (1048430 == var_60)) && (1 == mask_SORT_1)) && (829275 == var_8)) && (236898 == var_84)) RESULT: Ultimate proved your program to be correct! [2024-11-18 17:28:55,982 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