./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.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 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:04:18,156 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:04:18,215 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 05:04:18,219 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:04:18,220 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:04:18,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:04:18,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:04:18,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:04:18,247 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:04:18,250 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:04:18,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:04:18,250 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:04:18,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:04:18,251 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:04:18,251 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:04:18,251 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:04:18,252 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:04:18,252 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 05:04:18,252 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:04:18,252 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:04:18,253 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:04:18,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:04:18,256 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:04:18,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:04:18,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:04:18,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:04:18,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:04:18,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:04:18,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:04:18,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:04:18,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:04:18,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:04:18,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:04:18,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 05:04:18,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 05:04:18,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:04:18,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:04:18,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:04:18,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:04:18,258 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 -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2024-11-22 05:04:18,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:04:18,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:04:18,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:04:18,449 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:04:18,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:04:18,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-22 05:04:19,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:04:20,090 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:04:20,091 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-22 05:04:20,097 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851fb4dfc/52ed479e8fac423a9169d5b9efe8cdf2/FLAG0757173d1 [2024-11-22 05:04:20,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/851fb4dfc/52ed479e8fac423a9169d5b9efe8cdf2 [2024-11-22 05:04:20,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:04:20,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:04:20,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:04:20,494 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:04:20,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:04:20,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75159506 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20, skipping insertion in model container [2024-11-22 05:04:20,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,526 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:04:20,667 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.dyn_partition.c[1253,1266] [2024-11-22 05:04:20,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:04:20,708 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:04:20,718 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c[1253,1266] [2024-11-22 05:04:20,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:04:20,747 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:04:20,748 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20 WrapperNode [2024-11-22 05:04:20,748 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:04:20,749 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:04:20,749 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:04:20,749 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:04:20,754 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,765 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,804 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 196 [2024-11-22 05:04:20,805 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:04:20,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:04:20,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:04:20,806 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:04:20,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,846 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 05:04:20,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,921 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,925 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,934 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:04:20,936 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:04:20,936 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:04:20,936 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:04:20,937 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (1/1) ... [2024-11-22 05:04:20,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:04:20,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:04:20,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 05:04:20,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 05:04:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:04:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 05:04:21,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:04:21,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:04:21,091 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:04:21,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:04:21,395 INFO L? ?]: Removed 93 outVars from TransFormulas that were not future-live. [2024-11-22 05:04:21,395 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:04:21,404 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:04:21,405 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:04:21,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:04:21 BoogieIcfgContainer [2024-11-22 05:04:21,405 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:04:21,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:04:21,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:04:21,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:04:21,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:04:20" (1/3) ... [2024-11-22 05:04:21,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716c5810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:04:21, skipping insertion in model container [2024-11-22 05:04:21,410 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:20" (2/3) ... [2024-11-22 05:04:21,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@716c5810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:04:21, skipping insertion in model container [2024-11-22 05:04:21,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:04:21" (3/3) ... [2024-11-22 05:04:21,411 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-22 05:04:21,424 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:04:21,424 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:04:21,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:04:21,469 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;@1bd13241, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:04:21,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:04:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:21,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-22 05:04:21,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:21,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:04:21,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:21,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:21,482 INFO L85 PathProgramCache]: Analyzing trace with hash 379966597, now seen corresponding path program 1 times [2024-11-22 05:04:21,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:04:21,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42647640] [2024-11-22 05:04:21,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:04:21,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:04:21,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:04:21,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:21,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:04:21,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42647640] [2024-11-22 05:04:21,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42647640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:04:21,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:04:21,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:04:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2343049] [2024-11-22 05:04:21,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:04:21,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:04:21,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:04:21,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:04:21,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:04:21,998 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 53 states have internal predecessors, (77), 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 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:22,035 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2024-11-22 05:04:22,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:04:22,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-22 05:04:22,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:22,049 INFO L225 Difference]: With dead ends: 89 [2024-11-22 05:04:22,049 INFO L226 Difference]: Without dead ends: 53 [2024-11-22 05:04:22,052 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:04:22,056 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:22,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 207 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:04:22,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-22 05:04:22,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-11-22 05:04:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.4423076923076923) internal successors, (75), 52 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2024-11-22 05:04:22,084 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 17 [2024-11-22 05:04:22,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:22,084 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2024-11-22 05:04:22,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,084 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2024-11-22 05:04:22,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 05:04:22,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:22,085 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:04:22,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 05:04:22,086 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:22,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:22,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1104242150, now seen corresponding path program 1 times [2024-11-22 05:04:22,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:04:22,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668114934] [2024-11-22 05:04:22,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:04:22,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:04:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:04:22,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:22,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:04:22,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668114934] [2024-11-22 05:04:22,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668114934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:04:22,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:04:22,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:04:22,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314850883] [2024-11-22 05:04:22,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:04:22,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:04:22,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:04:22,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:04:22,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:04:22,202 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:22,233 INFO L93 Difference]: Finished difference Result 90 states and 127 transitions. [2024-11-22 05:04:22,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:04:22,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2024-11-22 05:04:22,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:22,235 INFO L225 Difference]: With dead ends: 90 [2024-11-22 05:04:22,235 INFO L226 Difference]: Without dead ends: 55 [2024-11-22 05:04:22,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:04:22,236 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:22,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 203 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:04:22,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-22 05:04:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-11-22 05:04:22,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.4259259259259258) internal successors, (77), 54 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2024-11-22 05:04:22,240 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 18 [2024-11-22 05:04:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:22,241 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2024-11-22 05:04:22,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2024-11-22 05:04:22,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 05:04:22,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:22,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:04:22,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 05:04:22,242 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:22,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:22,243 INFO L85 PathProgramCache]: Analyzing trace with hash -969734146, now seen corresponding path program 1 times [2024-11-22 05:04:22,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:04:22,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678466413] [2024-11-22 05:04:22,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:04:22,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:04:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:04:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:22,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:04:22,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678466413] [2024-11-22 05:04:22,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678466413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:04:22,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:04:22,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:04:22,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266886017] [2024-11-22 05:04:22,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:04:22,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:04:22,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:04:22,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:04:22,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:04:22,540 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:22,607 INFO L93 Difference]: Finished difference Result 111 states and 153 transitions. [2024-11-22 05:04:22,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:04:22,607 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 19 [2024-11-22 05:04:22,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:22,608 INFO L225 Difference]: With dead ends: 111 [2024-11-22 05:04:22,608 INFO L226 Difference]: Without dead ends: 74 [2024-11-22 05:04:22,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:04:22,610 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 37 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:22,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 235 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:04:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-22 05:04:22,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 58. [2024-11-22 05:04:22,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.4035087719298245) internal successors, (80), 57 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 80 transitions. [2024-11-22 05:04:22,615 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 80 transitions. Word has length 19 [2024-11-22 05:04:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:22,616 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 80 transitions. [2024-11-22 05:04:22,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 80 transitions. [2024-11-22 05:04:22,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 05:04:22,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:22,617 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:04:22,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 05:04:22,617 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:22,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:22,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1567557725, now seen corresponding path program 1 times [2024-11-22 05:04:22,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:04:22,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447778211] [2024-11-22 05:04:22,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:04:22,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:04:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:04:22,659 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:04:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:04:22,703 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 05:04:22,704 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:04:22,705 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:04:22,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 05:04:22,709 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-22 05:04:22,732 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:04:22,738 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:04:22 BoogieIcfgContainer [2024-11-22 05:04:22,739 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:04:22,739 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:04:22,740 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:04:22,740 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:04:22,741 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:04:21" (3/4) ... [2024-11-22 05:04:22,743 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 05:04:22,744 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:04:22,760 INFO L158 Benchmark]: Toolchain (without parser) took 2268.02ms. Allocated memory is still 163.6MB. Free memory was 94.8MB in the beginning and 132.0MB in the end (delta: -37.2MB). Peak memory consumption was 54.8MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,760 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:04:22,761 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.02ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 80.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,761 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.90ms. Allocated memory is still 163.6MB. Free memory was 80.3MB in the beginning and 75.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,761 INFO L158 Benchmark]: Boogie Preprocessor took 129.09ms. Allocated memory is still 163.6MB. Free memory was 75.2MB in the beginning and 132.9MB in the end (delta: -57.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,761 INFO L158 Benchmark]: RCFGBuilder took 469.67ms. Allocated memory is still 163.6MB. Free memory was 132.9MB in the beginning and 104.1MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,762 INFO L158 Benchmark]: TraceAbstraction took 1332.31ms. Allocated memory is still 163.6MB. Free memory was 103.5MB in the beginning and 49.3MB in the end (delta: 54.2MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,762 INFO L158 Benchmark]: Witness Printer took 20.11ms. Allocated memory is still 163.6MB. Free memory was 49.3MB in the beginning and 133.1MB in the end (delta: -83.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 05:04:22,764 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 117.4MB. Free memory is still 78.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.02ms. Allocated memory is still 163.6MB. Free memory was 94.6MB in the beginning and 80.3MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.90ms. Allocated memory is still 163.6MB. Free memory was 80.3MB in the beginning and 75.2MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 129.09ms. Allocated memory is still 163.6MB. Free memory was 75.2MB in the beginning and 132.9MB in the end (delta: -57.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 469.67ms. Allocated memory is still 163.6MB. Free memory was 132.9MB in the beginning and 104.1MB in the end (delta: 28.7MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 1332.31ms. Allocated memory is still 163.6MB. Free memory was 103.5MB in the beginning and 49.3MB in the end (delta: 54.2MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. * Witness Printer took 20.11ms. Allocated memory is still 163.6MB. Free memory was 49.3MB in the beginning and 133.1MB in the end (delta: -83.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 69. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 3); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (3 - 1); [L32] const SORT_23 mask_SORT_23 = (SORT_23)-1 >> (sizeof(SORT_23) * 8 - 32); [L33] const SORT_23 msb_SORT_23 = (SORT_23)1 << (32 - 1); [L35] const SORT_4 var_5 = 0; [L36] const SORT_1 var_13 = 1; [L37] const SORT_1 var_17 = 0; [L38] const SORT_23 var_25 = 1; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L43] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L44] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L44] SORT_4 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L45] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, var_13=1, var_17=0, var_25=1, var_5=0] [L46] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_4 init_7_arg_1 = var_5; [L49] state_6 = init_7_arg_1 [L50] SORT_4 init_9_arg_1 = var_5; [L51] state_8 = init_9_arg_1 [L52] SORT_1 init_19_arg_1 = var_17; [L53] state_18 = init_19_arg_1 [L54] SORT_1 init_21_arg_1 = var_17; [L55] state_20 = init_21_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L58] input_2 = __VERIFIER_nondet_uchar() [L59] input_3 = __VERIFIER_nondet_uchar() [L62] SORT_4 var_10_arg_0 = state_6; [L63] SORT_4 var_10_arg_1 = state_8; [L64] SORT_1 var_10 = var_10_arg_0 <= var_10_arg_1; [L65] SORT_1 var_14_arg_0 = var_10; [L66] SORT_1 var_14 = ~var_14_arg_0; [L67] SORT_1 var_15_arg_0 = var_13; [L68] SORT_1 var_15_arg_1 = var_14; VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_15_arg_0=1, var_15_arg_1=-2, var_25=1] [L69] EXPR var_15_arg_0 & var_15_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L69] SORT_1 var_15 = var_15_arg_0 & var_15_arg_1; [L70] EXPR var_15 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=7, state_18=0, state_20=0, state_6=0, state_8=0, var_13=1, var_25=1] [L70] var_15 = var_15 & mask_SORT_1 [L71] SORT_1 bad_16_arg_0 = var_15; [L72] CALL __VERIFIER_assert(!(bad_16_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 37 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 645 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 437 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 208 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=3, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 133 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 05:04:22,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.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 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:04:24,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:04:24,857 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 05:04:24,861 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:04:24,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:04:24,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:04:24,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:04:24,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:04:24,890 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:04:24,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:04:24,891 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:04:24,891 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:04:24,892 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:04:24,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:04:24,893 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:04:24,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:04:24,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:04:24,894 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:04:24,894 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:04:24,894 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:04:24,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:04:24,897 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 05:04:24,898 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 05:04:24,898 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:04:24,898 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 05:04:24,898 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:04:24,898 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:04:24,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:04:24,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:04:24,899 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:04:24,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:04:24,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:04:24,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:04:24,899 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:04:24,899 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:04:24,899 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 05:04:24,900 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 05:04:24,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:04:24,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:04:24,900 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:04:24,900 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:04:24,902 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 -> 807a67cda124a3fcd6cb05c7902844a26646fa59fdd69e67d53bd60fc10f4ac4 [2024-11-22 05:04:25,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:04:25,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:04:25,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:04:25,310 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:04:25,311 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:04:25,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-22 05:04:26,798 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:04:26,974 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:04:26,975 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-22 05:04:26,984 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601633d5e/452e4ab92b4f425195ee430588f22016/FLAG4f9bf8cea [2024-11-22 05:04:26,998 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/601633d5e/452e4ab92b4f425195ee430588f22016 [2024-11-22 05:04:27,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:04:27,001 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:04:27,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:04:27,004 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:04:27,008 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:04:27,008 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:04:26" (1/1) ... [2024-11-22 05:04:27,009 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ff5832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27, skipping insertion in model container [2024-11-22 05:04:27,009 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:04:26" (1/1) ... [2024-11-22 05:04:27,032 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:04:27,183 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.dyn_partition.c[1253,1266] [2024-11-22 05:04:27,227 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:04:27,242 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:04:27,254 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.dyn_partition.c[1253,1266] [2024-11-22 05:04:27,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:04:27,312 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:04:27,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27 WrapperNode [2024-11-22 05:04:27,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:04:27,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:04:27,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:04:27,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:04:27,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,339 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,361 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-22 05:04:27,361 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:04:27,363 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:04:27,363 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:04:27,363 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:04:27,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,375 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,388 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 05:04:27,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,398 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,408 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:04:27,413 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:04:27,413 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:04:27,413 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:04:27,414 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (1/1) ... [2024-11-22 05:04:27,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:04:27,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:04:27,442 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 05:04:27,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 05:04:27,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:04:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 05:04:27,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:04:27,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:04:27,645 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:04:27,648 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:04:27,875 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-22 05:04:27,875 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:04:27,889 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:04:27,889 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:04:27,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:04:27 BoogieIcfgContainer [2024-11-22 05:04:27,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:04:27,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:04:27,893 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:04:27,896 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:04:27,896 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:04:26" (1/3) ... [2024-11-22 05:04:27,897 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebbf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:04:27, skipping insertion in model container [2024-11-22 05:04:27,897 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:04:27" (2/3) ... [2024-11-22 05:04:27,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ebbf1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:04:27, skipping insertion in model container [2024-11-22 05:04:27,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:04:27" (3/3) ... [2024-11-22 05:04:27,900 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-22 05:04:27,915 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:04:27,916 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:04:27,973 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:04:27,980 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;@7e0b4ef4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:04:27,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:04:27,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:27,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 05:04:27,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:27,997 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 05:04:27,998 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:28,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 05:04:28,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:04:28,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [846470394] [2024-11-22 05:04:28,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:04:28,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:28,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:04:28,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:04:28,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 05:04:28,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:04:28,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 05:04:28,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:04:28,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:28,340 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 05:04:28,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:04:28,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [846470394] [2024-11-22 05:04:28,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [846470394] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:04:28,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:04:28,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:04:28,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938650134] [2024-11-22 05:04:28,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:04:28,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:04:28,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:04:28,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:04:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:04:28,385 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:28,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:28,413 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-22 05:04:28,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:04:28,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 05:04:28,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:28,420 INFO L225 Difference]: With dead ends: 18 [2024-11-22 05:04:28,420 INFO L226 Difference]: Without dead ends: 10 [2024-11-22 05:04:28,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:04:28,424 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:28,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:04:28,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-22 05:04:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-22 05:04:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:28,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 05:04:28,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 05:04:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:28,448 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 05:04:28,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:28,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 05:04:28,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 05:04:28,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:28,449 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:04:28,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-22 05:04:28,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:28,650 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:28,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:28,651 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 05:04:28,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:04:28,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493174133] [2024-11-22 05:04:28,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:04:28,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:28,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:04:28,654 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:04:28,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 05:04:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:04:28,724 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 05:04:28,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:04:28,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:28,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:04:29,254 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:29,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:04:29,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493174133] [2024-11-22 05:04:29,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [493174133] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:04:29,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:04:29,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 05:04:29,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860946114] [2024-11-22 05:04:29,258 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:04:29,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 05:04:29,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:04:29,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 05:04:29,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-22 05:04:29,260 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:29,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:29,307 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-22 05:04:29,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 05:04:29,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 05:04:29,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:29,309 INFO L225 Difference]: With dead ends: 15 [2024-11-22 05:04:29,309 INFO L226 Difference]: Without dead ends: 13 [2024-11-22 05:04:29,309 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:04:29,310 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:29,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:04:29,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-22 05:04:29,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2024-11-22 05:04:29,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-22 05:04:29,315 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-22 05:04:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:29,316 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-22 05:04:29,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-22 05:04:29,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 05:04:29,317 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:29,317 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-22 05:04:29,323 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-22 05:04:29,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:29,521 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:29,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:29,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-22 05:04:29,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:04:29,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047409258] [2024-11-22 05:04:29,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:04:29,523 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:29,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:04:29,525 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:04:29,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 05:04:29,591 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:04:29,591 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:04:29,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 05:04:29,600 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:04:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:29,809 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:04:30,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:30,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:04:30,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047409258] [2024-11-22 05:04:30,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047409258] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:04:30,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:04:30,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 05:04:30,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049744699] [2024-11-22 05:04:30,555 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:04:30,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 05:04:30,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:04:30,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 05:04:30,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:04:30,557 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:30,976 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2024-11-22 05:04:30,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 05:04:30,976 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-22 05:04:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:30,977 INFO L225 Difference]: With dead ends: 24 [2024-11-22 05:04:30,977 INFO L226 Difference]: Without dead ends: 22 [2024-11-22 05:04:30,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2024-11-22 05:04:30,978 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:30,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:04:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-22 05:04:30,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2024-11-22 05:04:30,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.05) internal successors, (21), 20 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-22 05:04:30,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2024-11-22 05:04:30,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 11 [2024-11-22 05:04:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:30,983 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2024-11-22 05:04:30,983 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2024-11-22 05:04:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 05:04:30,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:30,983 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1] [2024-11-22 05:04:30,988 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-22 05:04:31,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:31,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:31,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:31,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1003628899, now seen corresponding path program 3 times [2024-11-22 05:04:31,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:04:31,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634315042] [2024-11-22 05:04:31,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 05:04:31,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:31,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:04:31,196 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-22 05:04:31,197 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-22 05:04:31,294 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-22 05:04:31,294 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:04:31,296 INFO L255 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-22 05:04:31,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:04:31,690 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:31,690 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:04:35,093 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:35,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:04:35,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634315042] [2024-11-22 05:04:35,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634315042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:04:35,094 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:04:35,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-22 05:04:35,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981236527] [2024-11-22 05:04:35,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:04:35,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 05:04:35,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:04:35,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 05:04:35,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2024-11-22 05:04:35,096 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:38,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:04:38,206 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-22 05:04:38,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 05:04:38,206 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 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 20 [2024-11-22 05:04:38,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:04:38,207 INFO L225 Difference]: With dead ends: 42 [2024-11-22 05:04:38,207 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 05:04:38,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=298, Invalid=694, Unknown=0, NotChecked=0, Total=992 [2024-11-22 05:04:38,208 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 05:04:38,209 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 05:04:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 05:04:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2024-11-22 05:04:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-11-22 05:04:38,217 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 20 [2024-11-22 05:04:38,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:04:38,218 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-11-22 05:04:38,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:04:38,218 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-11-22 05:04:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 05:04:38,219 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:04:38,219 INFO L215 NwaCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1] [2024-11-22 05:04:38,226 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-22 05:04:38,419 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-22 05:04:38,420 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:04:38,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:04:38,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1673576541, now seen corresponding path program 4 times [2024-11-22 05:04:38,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:04:38,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [868259139] [2024-11-22 05:04:38,421 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 05:04:38,421 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:04:38,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:04:38,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:04:38,427 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 (6)] Waiting until timeout for monitored process [2024-11-22 05:04:38,642 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 05:04:38,643 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:04:38,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-22 05:04:38,654 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:04:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:04:39,462 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:05:14,157 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:05:14,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:05:14,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [868259139] [2024-11-22 05:05:14,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [868259139] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:05:14,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:05:14,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2024-11-22 05:05:14,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305330] [2024-11-22 05:05:14,158 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:05:14,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-22 05:05:14,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:05:14,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-22 05:05:14,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=847, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 05:05:14,160 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 34 states, 34 states have (on average 2.176470588235294) internal successors, (74), 34 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:05:25,073 WARN L286 SmtUtils]: Spent 7.18s on a formula simplification. DAG size of input: 1035 DAG size of output: 848 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 05:05:35,656 WARN L286 SmtUtils]: Spent 7.32s on a formula simplification. DAG size of input: 1038 DAG size of output: 850 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-22 05:05:43,656 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-22 05:05:43,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 05:05:43,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 44.4s TimeCoverageRelationStatistics Valid=545, Invalid=1617, Unknown=0, NotChecked=0, Total=2162 [2024-11-22 05:05:43,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-22 05:05:43,660 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:05:43,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 23 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-22 05:05:43,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-22 05:05:43,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:05:43,862 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:244) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:282) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:246) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:218) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:210) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1058) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:960) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:182) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:373) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 47 more [2024-11-22 05:05:43,865 INFO L158 Benchmark]: Toolchain (without parser) took 76864.26ms. Allocated memory was 83.9MB in the beginning and 509.6MB in the end (delta: 425.7MB). Free memory was 44.7MB in the beginning and 191.1MB in the end (delta: -146.3MB). Peak memory consumption was 280.7MB. Max. memory is 16.1GB. [2024-11-22 05:05:43,866 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 83.9MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:05:43,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.90ms. Allocated memory is still 83.9MB. Free memory was 44.3MB in the beginning and 53.8MB in the end (delta: -9.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2024-11-22 05:05:43,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 51.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:05:43,871 INFO L158 Benchmark]: Boogie Preprocessor took 46.24ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 05:05:43,871 INFO L158 Benchmark]: RCFGBuilder took 478.04ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 49.3MB in the beginning and 93.2MB in the end (delta: -43.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 05:05:43,871 INFO L158 Benchmark]: TraceAbstraction took 75972.54ms. Allocated memory was 117.4MB in the beginning and 509.6MB in the end (delta: 392.2MB). Free memory was 92.6MB in the beginning and 191.1MB in the end (delta: -98.4MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. [2024-11-22 05:05:43,872 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.18ms. Allocated memory is still 83.9MB. Free memory is still 65.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 309.90ms. Allocated memory is still 83.9MB. Free memory was 44.3MB in the beginning and 53.8MB in the end (delta: -9.4MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 51.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 46.24ms. Allocated memory is still 83.9MB. Free memory was 51.7MB in the beginning and 49.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 478.04ms. Allocated memory was 83.9MB in the beginning and 117.4MB in the end (delta: 33.6MB). Free memory was 49.3MB in the beginning and 93.2MB in the end (delta: -43.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 75972.54ms. Allocated memory was 117.4MB in the beginning and 509.6MB in the end (delta: 392.2MB). Free memory was 92.6MB in the beginning and 191.1MB in the end (delta: -98.4MB). Peak memory consumption was 294.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")