./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal12.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal12.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 7631e780ab762af7049f4f894b74af417e60ccfcde47865ef4ca17d480eda758 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:25:27,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:25:27,531 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:25:27,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:25:27,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:25:27,558 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:25:27,558 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:25:27,559 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:25:27,559 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:25:27,560 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:25:27,560 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:25:27,560 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:25:27,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:25:27,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:25:27,561 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:25:27,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:25:27,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:25:27,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:25:27,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:25:27,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:25:27,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:25:27,567 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:25:27,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:25:27,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:25:27,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:25:27,568 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:25:27,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:25:27,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:25:27,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:25:27,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:25:27,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:25:27,569 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:25:27,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:25:27,571 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 -> 7631e780ab762af7049f4f894b74af417e60ccfcde47865ef4ca17d480eda758 [2024-11-16 10:25:27,788 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:25:27,812 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:25:27,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:25:27,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:25:27,815 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:25:27,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal12.c [2024-11-16 10:25:29,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:25:29,407 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:25:29,407 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal12.c [2024-11-16 10:25:29,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd37a0e52/87a5b2b096ae494faf2370ef3cd01ffc/FLAG19eab1ba7 [2024-11-16 10:25:29,793 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd37a0e52/87a5b2b096ae494faf2370ef3cd01ffc [2024-11-16 10:25:29,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:25:29,797 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:25:29,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:25:29,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:25:29,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:25:29,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:25:29" (1/1) ... [2024-11-16 10:25:29,803 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b134db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:29, skipping insertion in model container [2024-11-16 10:25:29,803 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:25:29" (1/1) ... [2024-11-16 10:25:29,826 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:25:29,975 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.cal12.c[1245,1258] [2024-11-16 10:25:30,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:25:30,033 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:25:30,046 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.cal12.c[1245,1258] [2024-11-16 10:25:30,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:25:30,098 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:25:30,099 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30 WrapperNode [2024-11-16 10:25:30,099 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:25:30,100 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:25:30,101 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:25:30,101 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:25:30,106 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,168 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 303 [2024-11-16 10:25:30,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:25:30,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:25:30,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:25:30,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:25:30,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,194 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,221 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-16 10:25:30,222 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,222 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,237 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,240 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,244 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,247 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,258 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:25:30,259 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:25:30,259 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:25:30,260 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:25:30,260 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (1/1) ... [2024-11-16 10:25:30,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:25:30,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:25:30,295 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:25:30,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:25:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:25:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:25:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 10:25:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:25:30,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:25:30,410 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:25:30,412 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:25:30,780 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-16 10:25:30,780 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:25:30,811 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:25:30,811 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:25:30,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:25:30 BoogieIcfgContainer [2024-11-16 10:25:30,812 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:25:30,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:25:30,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:25:30,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:25:30,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:25:29" (1/3) ... [2024-11-16 10:25:30,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417a2ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:25:30, skipping insertion in model container [2024-11-16 10:25:30,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:30" (2/3) ... [2024-11-16 10:25:30,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@417a2ee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:25:30, skipping insertion in model container [2024-11-16 10:25:30,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:25:30" (3/3) ... [2024-11-16 10:25:30,820 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal12.c [2024-11-16 10:25:30,833 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:25:30,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:25:30,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:25:30,886 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;@2073b9e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:25:30,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:25:30,892 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 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-16 10:25:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 10:25:30,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:30,899 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:25:30,899 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:30,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:30,905 INFO L85 PathProgramCache]: Analyzing trace with hash 863941423, now seen corresponding path program 1 times [2024-11-16 10:25:30,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:25:30,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679708822] [2024-11-16 10:25:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:30,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:25:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:31,480 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-16 10:25:31,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:25:31,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679708822] [2024-11-16 10:25:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679708822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:25:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:25:31,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:25:31,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653986388] [2024-11-16 10:25:31,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:25:31,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:25:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:25:31,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:25:31,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:25:31,512 INFO L87 Difference]: Start difference. First operand has 77 states, 75 states have (on average 1.4666666666666666) internal successors, (110), 76 states have internal predecessors, (110), 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 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:25:31,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:31,594 INFO L93 Difference]: Finished difference Result 133 states and 193 transitions. [2024-11-16 10:25:31,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:25:31,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-16 10:25:31,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:31,603 INFO L225 Difference]: With dead ends: 133 [2024-11-16 10:25:31,603 INFO L226 Difference]: Without dead ends: 74 [2024-11-16 10:25:31,606 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-16 10:25:31,611 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:31,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 253 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:25:31,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-16 10:25:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-16 10:25:31,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 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-16 10:25:31,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 106 transitions. [2024-11-16 10:25:31,641 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 106 transitions. Word has length 28 [2024-11-16 10:25:31,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:31,642 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 106 transitions. [2024-11-16 10:25:31,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:25:31,642 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 106 transitions. [2024-11-16 10:25:31,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 10:25:31,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:31,643 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:25:31,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:25:31,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:31,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:31,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1157433749, now seen corresponding path program 1 times [2024-11-16 10:25:31,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:25:31,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452973440] [2024-11-16 10:25:31,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:31,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:25:31,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:31,780 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-16 10:25:31,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:25:31,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452973440] [2024-11-16 10:25:31,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452973440] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:25:31,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:25:31,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:25:31,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487361632] [2024-11-16 10:25:31,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:25:31,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:25:31,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:25:31,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:25:31,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:25:31,785 INFO L87 Difference]: Start difference. First operand 74 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:25:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:31,857 INFO L93 Difference]: Finished difference Result 132 states and 189 transitions. [2024-11-16 10:25:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:25:31,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-16 10:25:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:31,860 INFO L225 Difference]: With dead ends: 132 [2024-11-16 10:25:31,860 INFO L226 Difference]: Without dead ends: 76 [2024-11-16 10:25:31,860 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-16 10:25:31,861 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:31,862 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 250 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:25:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-16 10:25:31,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-11-16 10:25:31,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.44) internal successors, (108), 75 states have internal predecessors, (108), 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-16 10:25:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2024-11-16 10:25:31,870 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 29 [2024-11-16 10:25:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2024-11-16 10:25:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:25:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2024-11-16 10:25:31,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 10:25:31,872 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:31,872 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:25:31,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:25:31,872 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:31,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:31,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1267951444, now seen corresponding path program 1 times [2024-11-16 10:25:31,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:25:31,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242392735] [2024-11-16 10:25:31,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:31,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:25:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:32,134 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-16 10:25:32,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:25:32,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242392735] [2024-11-16 10:25:32,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242392735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:25:32,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:25:32,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:25:32,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012037160] [2024-11-16 10:25:32,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:25:32,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:25:32,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:25:32,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:25:32,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:25:32,136 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:25:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:32,289 INFO L93 Difference]: Finished difference Result 172 states and 242 transitions. [2024-11-16 10:25:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:25:32,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-16 10:25:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:32,290 INFO L225 Difference]: With dead ends: 172 [2024-11-16 10:25:32,290 INFO L226 Difference]: Without dead ends: 114 [2024-11-16 10:25:32,290 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:25:32,291 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 194 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:32,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 313 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:25:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-16 10:25:32,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 94. [2024-11-16 10:25:32,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4408602150537635) internal successors, (134), 93 states have internal predecessors, (134), 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-16 10:25:32,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 134 transitions. [2024-11-16 10:25:32,301 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 134 transitions. Word has length 30 [2024-11-16 10:25:32,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:32,302 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 134 transitions. [2024-11-16 10:25:32,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:25:32,302 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 134 transitions. [2024-11-16 10:25:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 10:25:32,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:32,303 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-16 10:25:32,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:25:32,303 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:32,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:32,304 INFO L85 PathProgramCache]: Analyzing trace with hash -938515472, now seen corresponding path program 1 times [2024-11-16 10:25:32,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:25:32,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6262759] [2024-11-16 10:25:32,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:32,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:25:32,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:32,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-16 10:25:32,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:25:32,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6262759] [2024-11-16 10:25:32,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6262759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:25:32,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:25:32,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:25:32,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276410577] [2024-11-16 10:25:32,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:25:32,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:25:32,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:25:32,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:25:32,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:25:32,551 INFO L87 Difference]: Start difference. First operand 94 states and 134 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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-16 10:25:32,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:32,728 INFO L93 Difference]: Finished difference Result 174 states and 244 transitions. [2024-11-16 10:25:32,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:25:32,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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-16 10:25:32,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:32,729 INFO L225 Difference]: With dead ends: 174 [2024-11-16 10:25:32,730 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 10:25:32,730 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-16 10:25:32,731 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 197 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:32,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 458 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:25:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 10:25:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2024-11-16 10:25:32,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.4375) internal successors, (138), 96 states have internal predecessors, (138), 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-16 10:25:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-16 10:25:32,737 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 31 [2024-11-16 10:25:32,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:32,737 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-16 10:25:32,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 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-16 10:25:32,737 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-16 10:25:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 10:25:32,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:32,738 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-16 10:25:32,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:25:32,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:32,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:32,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1102915163, now seen corresponding path program 1 times [2024-11-16 10:25:32,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:25:32,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049349809] [2024-11-16 10:25:32,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:32,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:25:32,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:33,079 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-16 10:25:33,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:25:33,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049349809] [2024-11-16 10:25:33,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049349809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:25:33,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:25:33,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:25:33,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335132] [2024-11-16 10:25:33,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:25:33,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:25:33,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:25:33,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:25:33,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:25:33,082 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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-16 10:25:33,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:33,287 INFO L93 Difference]: Finished difference Result 174 states and 243 transitions. [2024-11-16 10:25:33,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:25:33,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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-16 10:25:33,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:33,288 INFO L225 Difference]: With dead ends: 174 [2024-11-16 10:25:33,288 INFO L226 Difference]: Without dead ends: 116 [2024-11-16 10:25:33,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:25:33,290 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 191 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:33,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 516 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:25:33,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-16 10:25:33,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2024-11-16 10:25:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.43) internal successors, (143), 100 states have internal predecessors, (143), 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-16 10:25:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-11-16 10:25:33,295 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 32 [2024-11-16 10:25:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:33,295 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-11-16 10:25:33,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 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-16 10:25:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-11-16 10:25:33,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 10:25:33,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:33,296 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-16 10:25:33,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:25:33,297 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:33,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:33,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1907656409, now seen corresponding path program 1 times [2024-11-16 10:25:33,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:25:33,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984794375] [2024-11-16 10:25:33,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:33,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:25:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:25:33,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:25:33,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:25:33,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 10:25:33,352 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:25:33,353 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:25:33,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:25:33,358 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 10:25:33,389 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:25:33,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:25:33 BoogieIcfgContainer [2024-11-16 10:25:33,392 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:25:33,392 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:25:33,393 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:25:33,393 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:25:33,393 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:25:30" (3/4) ... [2024-11-16 10:25:33,395 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 10:25:33,396 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:25:33,397 INFO L158 Benchmark]: Toolchain (without parser) took 3600.42ms. Allocated memory was 180.4MB in the beginning and 226.5MB in the end (delta: 46.1MB). Free memory was 147.7MB in the beginning and 119.3MB in the end (delta: 28.4MB). Peak memory consumption was 75.2MB. Max. memory is 16.1GB. [2024-11-16 10:25:33,397 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 125.8MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:25:33,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.62ms. Allocated memory is still 180.4MB. Free memory was 147.7MB in the beginning and 131.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 10:25:33,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.28ms. Allocated memory is still 180.4MB. Free memory was 131.5MB in the beginning and 124.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 10:25:33,398 INFO L158 Benchmark]: Boogie Preprocessor took 86.46ms. Allocated memory is still 180.4MB. Free memory was 124.2MB in the beginning and 120.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:25:33,398 INFO L158 Benchmark]: IcfgBuilder took 552.75ms. Allocated memory is still 180.4MB. Free memory was 120.0MB in the beginning and 77.0MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-11-16 10:25:33,399 INFO L158 Benchmark]: TraceAbstraction took 2578.54ms. Allocated memory was 180.4MB in the beginning and 226.5MB in the end (delta: 46.1MB). Free memory was 76.0MB in the beginning and 119.3MB in the end (delta: -43.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2024-11-16 10:25:33,399 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 226.5MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:25:33,401 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.15ms. Allocated memory is still 125.8MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.62ms. Allocated memory is still 180.4MB. Free memory was 147.7MB in the beginning and 131.5MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 71.28ms. Allocated memory is still 180.4MB. Free memory was 131.5MB in the beginning and 124.2MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.46ms. Allocated memory is still 180.4MB. Free memory was 124.2MB in the beginning and 120.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 552.75ms. Allocated memory is still 180.4MB. Free memory was 120.0MB in the beginning and 77.0MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2578.54ms. Allocated memory was 180.4MB in the beginning and 226.5MB in the end (delta: 46.1MB). Free memory was 76.0MB in the beginning and 119.3MB in the end (delta: -43.3MB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 226.5MB. Free memory is still 119.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 92, overapproximation of bitwiseAnd at line 97. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_39 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, var_10=0, var_14=0, var_29=1, var_39=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 1; VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L79] EXPR var_20 & mask_SORT_1 VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_29=1, var_39=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 1; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_24=0, var_29=1, var_39=1] [L86] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_26_arg_0=-1, var_26_arg_1=1, var_29=1, var_39=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1, var_39=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 77 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 582 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 1790 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1389 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 600 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 401 mSDtfsCounter, 600 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 494 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-16 10:25:33,426 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.cal12.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 7631e780ab762af7049f4f894b74af417e60ccfcde47865ef4ca17d480eda758 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:25:35,416 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:25:35,485 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 10:25:35,489 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:25:35,490 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:25:35,516 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:25:35,517 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:25:35,517 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:25:35,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:25:35,519 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:25:35,520 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:25:35,520 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:25:35,520 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:25:35,522 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:25:35,522 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:25:35,522 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:25:35,522 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:25:35,523 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:25:35,523 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:25:35,523 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:25:35,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:25:35,526 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 10:25:35,526 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 10:25:35,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:25:35,526 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 10:25:35,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:25:35,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:25:35,527 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:25:35,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:25:35,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:25:35,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:25:35,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:25:35,527 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:25:35,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:25:35,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:25:35,528 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 10:25:35,528 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 10:25:35,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:25:35,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:25:35,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:25:35,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:25:35,530 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 -> 7631e780ab762af7049f4f894b74af417e60ccfcde47865ef4ca17d480eda758 [2024-11-16 10:25:35,809 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:25:35,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:25:35,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:25:35,832 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:25:35,832 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:25:35,833 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal12.c [2024-11-16 10:25:37,151 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:25:37,384 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:25:37,385 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal12.c [2024-11-16 10:25:37,395 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40387229c/764983098c99465393e3d6bf0ce5eb1c/FLAGeb2ff0a75 [2024-11-16 10:25:37,414 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40387229c/764983098c99465393e3d6bf0ce5eb1c [2024-11-16 10:25:37,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:25:37,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:25:37,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:25:37,421 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:25:37,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:25:37,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc6bdb2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37, skipping insertion in model container [2024-11-16 10:25:37,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:25:37,630 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.cal12.c[1245,1258] [2024-11-16 10:25:37,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:25:37,728 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:25:37,743 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.cal12.c[1245,1258] [2024-11-16 10:25:37,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:25:37,795 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:25:37,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37 WrapperNode [2024-11-16 10:25:37,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:25:37,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:25:37,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:25:37,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:25:37,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,813 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,842 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 175 [2024-11-16 10:25:37,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:25:37,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:25:37,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:25:37,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:25:37,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,856 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,860 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,881 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-16 10:25:37,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,894 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,901 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:25:37,902 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:25:37,902 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:25:37,902 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:25:37,903 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (1/1) ... [2024-11-16 10:25:37,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:25:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:25:37,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 10:25:37,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 10:25:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:25:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 10:25:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 10:25:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:25:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:25:38,114 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:25:38,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:25:38,373 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-16 10:25:38,374 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:25:38,385 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:25:38,385 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:25:38,386 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:25:38 BoogieIcfgContainer [2024-11-16 10:25:38,386 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:25:38,389 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:25:38,389 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:25:38,392 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:25:38,392 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:25:37" (1/3) ... [2024-11-16 10:25:38,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315ef20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:25:38, skipping insertion in model container [2024-11-16 10:25:38,393 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:25:37" (2/3) ... [2024-11-16 10:25:38,393 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@315ef20a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:25:38, skipping insertion in model container [2024-11-16 10:25:38,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:25:38" (3/3) ... [2024-11-16 10:25:38,395 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal12.c [2024-11-16 10:25:38,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:25:38,413 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:25:38,465 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:25:38,472 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;@400a0201, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:25:38,472 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:25:38,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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-16 10:25:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 10:25:38,485 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:38,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 10:25:38,488 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:38,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:38,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 10:25:38,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:25:38,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [221594546] [2024-11-16 10:25:38,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:38,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:25:38,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:25:38,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:25:38,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 10:25:38,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:38,638 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 10:25:38,646 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:25:38,809 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-16 10:25:38,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:25:38,810 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:25:38,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [221594546] [2024-11-16 10:25:38,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [221594546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:25:38,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:25:38,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:25:38,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282374851] [2024-11-16 10:25:38,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:25:38,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:25:38,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:25:38,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:25:38,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:25:38,841 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 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) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 10:25:38,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:38,887 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 10:25:38,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:25:38,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-16 10:25:38,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:38,898 INFO L225 Difference]: With dead ends: 22 [2024-11-16 10:25:38,898 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 10:25:38,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:25:38,905 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:38,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:25:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 10:25:38,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 10:25:38,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-16 10:25:38,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 10:25:38,934 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 10:25:38,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:38,935 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 10:25:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 10:25:38,936 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 10:25:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 10:25:38,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:38,937 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:25:38,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 10:25:39,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:25:39,144 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:39,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:39,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 10:25:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:25:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57050780] [2024-11-16 10:25:39,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:25:39,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:25:39,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:25:39,149 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:25:39,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 10:25:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:25:39,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 10:25:39,260 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:25:39,424 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-16 10:25:39,424 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:25:40,182 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-16 10:25:40,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:25:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57050780] [2024-11-16 10:25:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57050780] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:25:40,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:25:40,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 10:25:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365619703] [2024-11-16 10:25:40,184 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:25:40,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:25:40,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:25:40,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:25:40,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:25:40,187 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-16 10:25:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:25:40,258 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 10:25:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:25:40,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) Word has length 9 [2024-11-16 10:25:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:25:40,260 INFO L225 Difference]: With dead ends: 16 [2024-11-16 10:25:40,260 INFO L226 Difference]: Without dead ends: 13 [2024-11-16 10:25:40,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:25:40,261 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:25:40,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:25:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-16 10:25:40,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-16 10:25:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-16 10:25:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 10:25:40,269 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 10:25:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:25:40,269 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 10:25:40,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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-16 10:25:40,270 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 10:25:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 10:25:40,270 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:25:40,271 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 10:25:40,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 10:25:40,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:25:40,472 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:25:40,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:25:40,473 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 10:25:40,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:25:40,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963161283] [2024-11-16 10:25:40,473 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:25:40,473 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:25:40,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:25:40,475 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:25:40,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 10:25:40,600 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:25:40,601 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:25:40,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-16 10:25:40,608 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:25:41,941 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:25:41,942 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:26:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:26:03,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:26:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963161283] [2024-11-16 10:26:03,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963161283] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:26:03,018 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:26:03,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-16 10:26:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948056630] [2024-11-16 10:26:03,018 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:26:03,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 10:26:03,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:26:03,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 10:26:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:26:03,020 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-16 10:26:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:26:03,124 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-16 10:26:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:26:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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 12 [2024-11-16 10:26:03,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:26:03,125 INFO L225 Difference]: With dead ends: 13 [2024-11-16 10:26:03,125 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 10:26:03,125 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-16 10:26:03,126 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:26:03,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 18 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:26:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 10:26:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 10:26:03,127 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-16 10:26:03,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 10:26:03,127 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-16 10:26:03,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:26:03,127 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 10:26:03,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-16 10:26:03,127 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 10:26:03,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 10:26:03,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:26:03,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 10:26:03,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 10:26:03,333 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-16 10:26:03,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 10:26:03,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:26:03,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:26:03 BoogieIcfgContainer [2024-11-16 10:26:03,417 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:26:03,417 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:26:03,417 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:26:03,417 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:26:03,418 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:25:38" (3/4) ... [2024-11-16 10:26:03,420 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 10:26:03,428 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-16 10:26:03,429 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 10:26:03,431 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 10:26:03,431 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 10:26:03,431 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 10:26:03,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 10:26:03,518 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 10:26:03,518 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:26:03,518 INFO L158 Benchmark]: Toolchain (without parser) took 26099.76ms. Allocated memory was 60.8MB in the beginning and 1.0GB in the end (delta: 975.2MB). Free memory was 31.3MB in the beginning and 454.2MB in the end (delta: -422.9MB). Peak memory consumption was 552.9MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,519 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 40.1MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:26:03,519 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.52ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 31.1MB in the beginning and 54.4MB in the end (delta: -23.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,519 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.23ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 52.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,519 INFO L158 Benchmark]: Boogie Preprocessor took 55.88ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,519 INFO L158 Benchmark]: IcfgBuilder took 484.64ms. Allocated memory is still 81.8MB. Free memory was 49.3MB in the beginning and 54.3MB in the end (delta: -5.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,520 INFO L158 Benchmark]: TraceAbstraction took 25028.07ms. Allocated memory was 81.8MB in the beginning and 1.0GB in the end (delta: 954.2MB). Free memory was 53.8MB in the beginning and 460.5MB in the end (delta: -406.6MB). Peak memory consumption was 547.9MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,520 INFO L158 Benchmark]: Witness Printer took 100.75ms. Allocated memory is still 1.0GB. Free memory was 460.5MB in the beginning and 454.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 10:26:03,521 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.13ms. Allocated memory is still 60.8MB. Free memory was 40.2MB in the beginning and 40.1MB in the end (delta: 73.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.52ms. Allocated memory was 60.8MB in the beginning and 81.8MB in the end (delta: 21.0MB). Free memory was 31.1MB in the beginning and 54.4MB in the end (delta: -23.3MB). Peak memory consumption was 11.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.23ms. Allocated memory is still 81.8MB. Free memory was 54.0MB in the beginning and 52.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.88ms. Allocated memory is still 81.8MB. Free memory was 52.0MB in the beginning and 49.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 484.64ms. Allocated memory is still 81.8MB. Free memory was 49.3MB in the beginning and 54.3MB in the end (delta: -5.0MB). Peak memory consumption was 21.3MB. Max. memory is 16.1GB. * TraceAbstraction took 25028.07ms. Allocated memory was 81.8MB in the beginning and 1.0GB in the end (delta: 954.2MB). Free memory was 53.8MB in the beginning and 460.5MB in the end (delta: -406.6MB). Peak memory consumption was 547.9MB. Max. memory is 16.1GB. * Witness Printer took 100.75ms. Allocated memory is still 1.0GB. Free memory was 460.5MB in the beginning and 454.2MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.9s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 35 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 14 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 23.5s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 12 QuantifiedInterpolants, 47135 SizeOfPredicates, 23 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 10:26:03,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE