./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.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.cal57.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 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:41:27,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:41:27,168 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:41:27,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:41:27,173 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:41:27,203 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:41:27,205 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:41:27,206 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:41:27,206 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:41:27,208 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:41:27,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:41:27,209 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:41:27,220 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:41:27,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:41:27,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:41:27,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:41:27,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:41:27,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:41:27,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:41:27,222 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:41:27,223 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:41:27,224 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:41:27,225 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:41:27,225 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:41:27,225 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:41:27,225 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:41:27,225 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:41:27,226 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:41:27,226 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:41:27,226 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:41:27,226 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:41:27,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:41:27,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:41:27,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:41:27,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:41:27,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:41:27,228 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:41:27,228 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:41:27,229 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:41:27,230 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 -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-11-16 10:41:27,488 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:41:27,516 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:41:27,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:41:27,521 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:41:27,522 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:41:27,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-16 10:41:28,892 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:41:29,114 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:41:29,117 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-16 10:41:29,130 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04a5961d/d8573edb1a6f47d08b481bf677d2be97/FLAG3760d715b [2024-11-16 10:41:29,146 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c04a5961d/d8573edb1a6f47d08b481bf677d2be97 [2024-11-16 10:41:29,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:41:29,152 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:41:29,155 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:41:29,155 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:41:29,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:41:29,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41336914 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29, skipping insertion in model container [2024-11-16 10:41:29,162 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:41:29,334 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.cal57.c[1245,1258] [2024-11-16 10:41:29,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:41:29,414 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:41:29,424 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.cal57.c[1245,1258] [2024-11-16 10:41:29,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:41:29,482 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:41:29,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29 WrapperNode [2024-11-16 10:41:29,483 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:41:29,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:41:29,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:41:29,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:41:29,491 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:41:29" (1/1) ... [2024-11-16 10:41:29,502 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:41:29" (1/1) ... [2024-11-16 10:41:29,565 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2024-11-16 10:41:29,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:41:29,566 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:41:29,566 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:41:29,566 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:41:29,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,589 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,614 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:41:29,614 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,637 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,644 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,659 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:41:29,661 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:41:29,661 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:41:29,661 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:41:29,663 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (1/1) ... [2024-11-16 10:41:29,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:41:29,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:41:29,697 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:41:29,703 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:41:29,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:41:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:41:29,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 10:41:29,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:41:29,755 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:41:29,875 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:41:29,878 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:41:30,331 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-16 10:41:30,335 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:41:30,362 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:41:30,363 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:41:30,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:41:30 BoogieIcfgContainer [2024-11-16 10:41:30,363 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:41:30,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:41:30,366 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:41:30,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:41:30,369 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:41:29" (1/3) ... [2024-11-16 10:41:30,369 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112e7aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:41:30, skipping insertion in model container [2024-11-16 10:41:30,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:29" (2/3) ... [2024-11-16 10:41:30,370 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@112e7aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:41:30, skipping insertion in model container [2024-11-16 10:41:30,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:41:30" (3/3) ... [2024-11-16 10:41:30,371 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-11-16 10:41:30,391 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:41:30,391 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:41:30,473 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:41:30,485 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;@33eee450, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:41:30,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:41:30,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 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:41:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 10:41:30,520 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:30,521 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:41:30,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:30,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:30,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1113156271, now seen corresponding path program 1 times [2024-11-16 10:41:30,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:41:30,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401880401] [2024-11-16 10:41:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:41:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:31,167 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:41:31,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:41:31,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401880401] [2024-11-16 10:41:31,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401880401] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:41:31,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:41:31,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:41:31,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56427920] [2024-11-16 10:41:31,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:41:31,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:41:31,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:41:31,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:41:31,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:41:31,205 INFO L87 Difference]: Start difference. First operand has 69 states, 67 states have (on average 1.462686567164179) internal successors, (98), 68 states have internal predecessors, (98), 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:41:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:31,298 INFO L93 Difference]: Finished difference Result 117 states and 169 transitions. [2024-11-16 10:41:31,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:41:31,301 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:41:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:31,311 INFO L225 Difference]: With dead ends: 117 [2024-11-16 10:41:31,311 INFO L226 Difference]: Without dead ends: 66 [2024-11-16 10:41:31,314 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:41:31,319 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:41:31,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 223 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:41:31,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-16 10:41:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-16 10:41:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 65 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:41:31,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 94 transitions. [2024-11-16 10:41:31,354 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 94 transitions. Word has length 28 [2024-11-16 10:41:31,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:31,355 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 94 transitions. [2024-11-16 10:41:31,355 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:41:31,355 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 94 transitions. [2024-11-16 10:41:31,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 10:41:31,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:31,357 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:41:31,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:41:31,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash 293159431, now seen corresponding path program 1 times [2024-11-16 10:41:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:41:31,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703250684] [2024-11-16 10:41:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:41:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:31,519 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:41:31,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:41:31,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703250684] [2024-11-16 10:41:31,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703250684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:41:31,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:41:31,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:41:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240828475] [2024-11-16 10:41:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:41:31,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:41:31,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:41:31,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:41:31,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:41:31,526 INFO L87 Difference]: Start difference. First operand 66 states and 94 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:41:31,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:31,592 INFO L93 Difference]: Finished difference Result 116 states and 165 transitions. [2024-11-16 10:41:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:41:31,593 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:41:31,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:31,594 INFO L225 Difference]: With dead ends: 116 [2024-11-16 10:41:31,594 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 10:41:31,594 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:41:31,595 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:41:31,596 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:41:31,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 10:41:31,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-11-16 10:41:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.4328358208955223) internal successors, (96), 67 states have internal predecessors, (96), 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:41:31,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2024-11-16 10:41:31,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 29 [2024-11-16 10:41:31,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:31,607 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2024-11-16 10:41:31,607 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:41:31,607 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2024-11-16 10:41:31,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 10:41:31,608 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:31,609 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:41:31,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 10:41:31,609 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:31,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 245251348, now seen corresponding path program 1 times [2024-11-16 10:41:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:41:31,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410553739] [2024-11-16 10:41:31,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:41:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:32,005 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:41:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:41:32,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410553739] [2024-11-16 10:41:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410553739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:41:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:41:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 10:41:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738536468] [2024-11-16 10:41:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:41:32,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 10:41:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:41:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 10:41:32,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 10:41:32,008 INFO L87 Difference]: Start difference. First operand 68 states and 96 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:41:32,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:32,182 INFO L93 Difference]: Finished difference Result 156 states and 218 transitions. [2024-11-16 10:41:32,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 10:41:32,183 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:41:32,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:32,184 INFO L225 Difference]: With dead ends: 156 [2024-11-16 10:41:32,184 INFO L226 Difference]: Without dead ends: 106 [2024-11-16 10:41:32,184 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:41:32,185 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 182 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:41:32,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 277 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:41:32,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-16 10:41:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 86. [2024-11-16 10:41:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 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:41:32,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 122 transitions. [2024-11-16 10:41:32,201 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 122 transitions. Word has length 30 [2024-11-16 10:41:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:32,205 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 122 transitions. [2024-11-16 10:41:32,205 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:41:32,205 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 122 transitions. [2024-11-16 10:41:32,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 10:41:32,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:32,206 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:41:32,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:41:32,207 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:32,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:32,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1717519906, now seen corresponding path program 1 times [2024-11-16 10:41:32,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:41:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508923824] [2024-11-16 10:41:32,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:32,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:41:32,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:32,510 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:41:32,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:41:32,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508923824] [2024-11-16 10:41:32,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508923824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:41:32,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:41:32,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 10:41:32,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198891134] [2024-11-16 10:41:32,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:41:32,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:41:32,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:41:32,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:41:32,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:41:32,513 INFO L87 Difference]: Start difference. First operand 86 states and 122 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:41:32,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:32,704 INFO L93 Difference]: Finished difference Result 158 states and 220 transitions. [2024-11-16 10:41:32,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:41:32,704 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:41:32,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:32,705 INFO L225 Difference]: With dead ends: 158 [2024-11-16 10:41:32,705 INFO L226 Difference]: Without dead ends: 108 [2024-11-16 10:41:32,706 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:41:32,707 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 185 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:41:32,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 404 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:41:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-16 10:41:32,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2024-11-16 10:41:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 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:41:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 126 transitions. [2024-11-16 10:41:32,713 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 126 transitions. Word has length 31 [2024-11-16 10:41:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:32,714 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 126 transitions. [2024-11-16 10:41:32,714 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:41:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2024-11-16 10:41:32,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-16 10:41:32,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:32,715 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:41:32,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 10:41:32,716 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:32,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:32,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1772326239, now seen corresponding path program 1 times [2024-11-16 10:41:32,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:41:32,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348737461] [2024-11-16 10:41:32,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:32,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:41:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:33,244 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:41:33,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:41:33,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348737461] [2024-11-16 10:41:33,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348737461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:41:33,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:41:33,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 10:41:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794469449] [2024-11-16 10:41:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:41:33,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 10:41:33,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:41:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 10:41:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-16 10:41:33,247 INFO L87 Difference]: Start difference. First operand 89 states and 126 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:41:33,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:33,508 INFO L93 Difference]: Finished difference Result 158 states and 219 transitions. [2024-11-16 10:41:33,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:41:33,508 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:41:33,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:33,509 INFO L225 Difference]: With dead ends: 158 [2024-11-16 10:41:33,511 INFO L226 Difference]: Without dead ends: 108 [2024-11-16 10:41:33,512 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:41:33,513 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 179 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:41:33,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 453 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:41:33,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-16 10:41:33,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 93. [2024-11-16 10:41:33,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.423913043478261) internal successors, (131), 92 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:41:33,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 131 transitions. [2024-11-16 10:41:33,519 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 131 transitions. Word has length 32 [2024-11-16 10:41:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:33,519 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 131 transitions. [2024-11-16 10:41:33,520 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:41:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2024-11-16 10:41:33,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 10:41:33,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:33,521 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:41:33,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 10:41:33,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:33,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:33,522 INFO L85 PathProgramCache]: Analyzing trace with hash -482519902, now seen corresponding path program 1 times [2024-11-16 10:41:33,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:41:33,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755670696] [2024-11-16 10:41:33,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:33,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:41:33,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:41:33,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:41:33,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:41:33,615 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 10:41:33,616 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:41:33,617 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:41:33,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 10:41:33,622 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 10:41:33,660 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:41:33,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:41:33 BoogieIcfgContainer [2024-11-16 10:41:33,663 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:41:33,664 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:41:33,664 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:41:33,664 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:41:33,665 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:41:30" (3/4) ... [2024-11-16 10:41:33,670 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 10:41:33,671 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:41:33,672 INFO L158 Benchmark]: Toolchain (without parser) took 4520.36ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 120.7MB in the beginning and 80.8MB in the end (delta: 39.8MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2024-11-16 10:41:33,672 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:41:33,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.74ms. Allocated memory is still 176.2MB. Free memory was 120.7MB in the beginning and 104.4MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 10:41:33,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.92ms. Allocated memory is still 176.2MB. Free memory was 104.4MB in the beginning and 97.6MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 10:41:33,673 INFO L158 Benchmark]: Boogie Preprocessor took 93.62ms. Allocated memory is still 176.2MB. Free memory was 97.6MB in the beginning and 93.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:41:33,674 INFO L158 Benchmark]: IcfgBuilder took 702.38ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 51.9MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2024-11-16 10:41:33,674 INFO L158 Benchmark]: TraceAbstraction took 3298.17ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 51.1MB in the beginning and 81.9MB in the end (delta: -30.8MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. [2024-11-16 10:41:33,674 INFO L158 Benchmark]: Witness Printer took 7.30ms. Allocated memory is still 260.0MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:41:33,676 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.20ms. Allocated memory is still 176.2MB. Free memory is still 139.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.74ms. Allocated memory is still 176.2MB. Free memory was 120.7MB in the beginning and 104.4MB in the end (delta: 16.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.92ms. Allocated memory is still 176.2MB. Free memory was 104.4MB in the beginning and 97.6MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 93.62ms. Allocated memory is still 176.2MB. Free memory was 97.6MB in the beginning and 93.0MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 702.38ms. Allocated memory is still 176.2MB. Free memory was 93.0MB in the beginning and 51.9MB in the end (delta: 41.1MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3298.17ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 51.1MB in the beginning and 81.9MB in the end (delta: -30.8MB). Peak memory consumption was 54.9MB. Max. memory is 16.1GB. * Witness Printer took 7.30ms. Allocated memory is still 260.0MB. Free memory was 81.9MB in the beginning and 80.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 96, overapproximation of bitwiseAnd at line 101. 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 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 1; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_21=1, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_25=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_28_arg_0=-1, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-1] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 1577 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1223 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 537 IncrementalHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 354 mSDtfsCounter, 537 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=93occurred 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.6s InterpolantComputationTime, 183 NumberOfCodeBlocks, 183 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 145 ConstructedInterpolants, 0 QuantifiedInterpolants, 505 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:41:33,707 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.cal57.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 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:41:35,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:41:36,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 10:41:36,035 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:41:36,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:41:36,077 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:41:36,079 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:41:36,079 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:41:36,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:41:36,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:41:36,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:41:36,082 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:41:36,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:41:36,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:41:36,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:41:36,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:41:36,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:41:36,085 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:41:36,085 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:41:36,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:41:36,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:41:36,086 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 10:41:36,086 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 10:41:36,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:41:36,087 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 10:41:36,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:41:36,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:41:36,088 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:41:36,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:41:36,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:41:36,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:41:36,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:41:36,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:41:36,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:41:36,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:41:36,089 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 10:41:36,090 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 10:41:36,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:41:36,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:41:36,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:41:36,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:41:36,092 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 -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-11-16 10:41:36,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:41:36,450 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:41:36,453 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:41:36,455 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:41:36,455 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:41:36,456 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-16 10:41:37,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:41:38,200 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:41:38,201 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-16 10:41:38,209 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dd1bee6/ccf880dc835b4edbbfd4a9227897d3e0/FLAG7915346ba [2024-11-16 10:41:38,560 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3dd1bee6/ccf880dc835b4edbbfd4a9227897d3e0 [2024-11-16 10:41:38,562 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:41:38,563 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:41:38,565 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:41:38,565 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:41:38,569 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:41:38,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:38,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34844f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38, skipping insertion in model container [2024-11-16 10:41:38,571 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:38,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:41:38,791 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.cal57.c[1245,1258] [2024-11-16 10:41:38,865 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:41:38,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:41:38,890 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.cal57.c[1245,1258] [2024-11-16 10:41:38,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:41:38,959 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:41:38,960 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38 WrapperNode [2024-11-16 10:41:38,960 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:41:38,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:41:38,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:41:38,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:41:38,968 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:41:38" (1/1) ... [2024-11-16 10:41:38,978 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:41:38" (1/1) ... [2024-11-16 10:41:39,010 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 183 [2024-11-16 10:41:39,014 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:41:39,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:41:39,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:41:39,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:41:39,026 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,026 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,037 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,059 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:41:39,060 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,060 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,065 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,066 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,069 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,071 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:41:39,076 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:41:39,076 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:41:39,076 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:41:39,077 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (1/1) ... [2024-11-16 10:41:39,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:41:39,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:41:39,110 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:41:39,116 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:41:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:41:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 10:41:39,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 10:41:39,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:41:39,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:41:39,264 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:41:39,266 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:41:39,560 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-16 10:41:39,560 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:41:39,574 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:41:39,574 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:41:39,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:41:39 BoogieIcfgContainer [2024-11-16 10:41:39,576 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:41:39,578 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:41:39,579 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:41:39,582 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:41:39,582 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:41:38" (1/3) ... [2024-11-16 10:41:39,583 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767d24b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:41:39, skipping insertion in model container [2024-11-16 10:41:39,583 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:41:38" (2/3) ... [2024-11-16 10:41:39,584 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@767d24b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:41:39, skipping insertion in model container [2024-11-16 10:41:39,584 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:41:39" (3/3) ... [2024-11-16 10:41:39,585 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-11-16 10:41:39,606 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:41:39,606 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:41:39,655 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:41:39,663 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;@b075c90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:41:39,664 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:41:39,668 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:41:39,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 10:41:39,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:39,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 10:41:39,677 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:39,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:39,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 10:41:39,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:41:39,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1155287425] [2024-11-16 10:41:39,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:39,699 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:41:39,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:41:39,702 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:41:39,703 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:41:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:39,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 10:41:39,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:41:40,017 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:41:40,018 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:41:40,018 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:41:40,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1155287425] [2024-11-16 10:41:40,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1155287425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:41:40,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:41:40,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:41:40,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648985524] [2024-11-16 10:41:40,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:41:40,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:41:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:41:40,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:41:40,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:41:40,052 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:41:40,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:40,092 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 10:41:40,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:41:40,094 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:41:40,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:40,101 INFO L225 Difference]: With dead ends: 22 [2024-11-16 10:41:40,101 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 10:41:40,104 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:41:40,109 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:41:40,110 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:41:40,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 10:41:40,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 10:41:40,136 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:41:40,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 10:41:40,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 10:41:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:40,138 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 10:41:40,139 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:41:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 10:41:40,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 10:41:40,140 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:40,140 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:41:40,145 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:41:40,341 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:41:40,342 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:40,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:40,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 10:41:40,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:41:40,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927465645] [2024-11-16 10:41:40,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:41:40,344 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:41:40,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:41:40,349 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:41:40,350 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:41:40,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:41:40,453 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-16 10:41:40,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:41:40,791 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:41:40,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:41:42,161 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:41:42,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:41:42,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927465645] [2024-11-16 10:41:42,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927465645] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:41:42,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:41:42,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 10:41:42,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931107635] [2024-11-16 10:41:42,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:41:42,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:41:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:41:42,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:41:42,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:41:42,165 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:41:42,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:41:42,247 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 10:41:42,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:41:42,248 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:41:42,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:41:42,248 INFO L225 Difference]: With dead ends: 16 [2024-11-16 10:41:42,249 INFO L226 Difference]: Without dead ends: 13 [2024-11-16 10:41:42,249 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-16 10:41:42,250 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:41:42,251 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:41:42,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-16 10:41:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-16 10:41:42,253 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:41:42,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 10:41:42,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 10:41:42,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:41:42,254 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 10:41:42,254 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:41:42,254 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 10:41:42,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 10:41:42,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:41:42,255 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 10:41:42,259 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:41:42,458 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:41:42,458 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:41:42,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:41:42,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 10:41:42,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:41:42,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448961607] [2024-11-16 10:41:42,460 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:41:42,460 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:41:42,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:41:42,463 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:41:42,464 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:41:42,610 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:41:42,611 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:41:42,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-16 10:41:42,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:41:43,692 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:41:43,693 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:42:05,145 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:42:05,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:42:05,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448961607] [2024-11-16 10:42:05,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [448961607] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:42:05,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:42:05,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-16 10:42:05,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815307429] [2024-11-16 10:42:05,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:42:05,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 10:42:05,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:42:05,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 10:42:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-16 10:42:05,150 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:42:05,354 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2024-11-16 10:42:05,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:42:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:42:05,355 INFO L225 Difference]: With dead ends: 19 [2024-11-16 10:42:05,356 INFO L226 Difference]: Without dead ends: 16 [2024-11-16 10:42:05,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-16 10:42:05,358 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:42:05,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:42:05,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-16 10:42:05,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2024-11-16 10:42:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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:42:05,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 10:42:05,362 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 12 [2024-11-16 10:42:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:42:05,362 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 10:42:05,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.75) internal successors, (21), 12 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:42:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 10:42:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 10:42:05,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:42:05,363 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 10:42:05,368 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:42:05,563 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:42:05,564 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:42:05,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:42:05,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 3 times [2024-11-16 10:42:05,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:42:05,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [256050834] [2024-11-16 10:42:05,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 10:42:05,566 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:42:05,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:42:05,569 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 10:42:05,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 10:42:05,718 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-16 10:42:05,719 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:42:05,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-16 10:42:05,729 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:42:06,902 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 10:42:06,902 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:42:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-16 10:42:52,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:42:52,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [256050834] [2024-11-16 10:42:52,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [256050834] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:42:52,892 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:42:52,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 10:42:52,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283430488] [2024-11-16 10:42:52,892 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:42:52,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 10:42:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:42:52,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 10:42:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-16 10:42:52,894 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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:42:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:42:53,085 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 10:42:53,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:42:53,086 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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 15 [2024-11-16 10:42:53,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:42:53,086 INFO L225 Difference]: With dead ends: 16 [2024-11-16 10:42:53,086 INFO L226 Difference]: Without dead ends: 0 [2024-11-16 10:42:53,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-16 10:42:53,088 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:42:53,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:42:53,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-16 10:42:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-16 10:42:53,089 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:42:53,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-16 10:42:53,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2024-11-16 10:42:53,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:42:53,089 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-16 10:42:53,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 14 states have internal predecessors, (23), 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:42:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-16 10:42:53,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-16 10:42:53,092 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:42:53,096 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 (5)] Ended with exit code 0 [2024-11-16 10:42:53,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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:42:53,296 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-16 10:42:53,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-16 10:42:53,476 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:42:53,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:42:53 BoogieIcfgContainer [2024-11-16 10:42:53,486 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:42:53,487 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:42:53,487 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:42:53,487 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:42:53,488 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:41:39" (3/4) ... [2024-11-16 10:42:53,491 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 10:42:53,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2024-11-16 10:42:53,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-16 10:42:53,500 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-16 10:42:53,501 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 10:42:53,503 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 10:42:53,621 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 10:42:53,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 10:42:53,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:42:53,624 INFO L158 Benchmark]: Toolchain (without parser) took 75060.34ms. Allocated memory was 67.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 42.8MB in the beginning and 551.3MB in the end (delta: -508.5MB). Peak memory consumption was 640.5MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,624 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory was 26.7MB in the beginning and 26.6MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:42:53,625 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.98ms. Allocated memory is still 67.1MB. Free memory was 42.6MB in the beginning and 45.8MB in the end (delta: -3.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.41ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 43.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,625 INFO L158 Benchmark]: Boogie Preprocessor took 56.04ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 40.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,625 INFO L158 Benchmark]: IcfgBuilder took 500.18ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 40.8MB in the beginning and 54.1MB in the end (delta: -13.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,626 INFO L158 Benchmark]: TraceAbstraction took 73908.05ms. Allocated memory was 81.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 53.6MB in the beginning and 556.5MB in the end (delta: -503.0MB). Peak memory consumption was 631.0MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,626 INFO L158 Benchmark]: Witness Printer took 136.39ms. Allocated memory is still 1.2GB. Free memory was 556.5MB in the beginning and 551.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 10:42:53,628 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 44.0MB. Free memory was 26.7MB in the beginning and 26.6MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.98ms. Allocated memory is still 67.1MB. Free memory was 42.6MB in the beginning and 45.8MB in the end (delta: -3.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.41ms. Allocated memory is still 67.1MB. Free memory was 45.8MB in the beginning and 43.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.04ms. Allocated memory is still 67.1MB. Free memory was 43.6MB in the beginning and 40.8MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 500.18ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 40.8MB in the beginning and 54.1MB in the end (delta: -13.3MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 73908.05ms. Allocated memory was 81.8MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 53.6MB in the beginning and 556.5MB in the end (delta: -503.0MB). Peak memory consumption was 631.0MB. Max. memory is 16.1GB. * Witness Printer took 136.39ms. Allocated memory is still 1.2GB. Free memory was 556.5MB in the beginning and 551.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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: 73.7s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 88 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 70 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 126 IncrementalHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 18 mSDtfsCounter, 126 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 14.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 71.6s InterpolantComputationTime, 42 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 71 ConstructedInterpolants, 27 QuantifiedInterpolants, 107388 SizeOfPredicates, 38 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/48 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: 59]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-16 10:42:53,696 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