./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.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 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:57:59,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:57:59,478 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-24 03:57:59,482 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:57:59,483 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:57:59,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:57:59,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:57:59,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:57:59,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:57:59,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:57:59,505 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:57:59,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:57:59,505 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:57:59,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:57:59,506 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:57:59,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:57:59,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:57:59,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 03:57:59,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:57:59,508 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:57:59,508 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:57:59,513 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:57:59,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:57:59,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:57:59,514 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:57:59,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:57:59,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:57:59,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:57:59,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:57:59,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:57:59,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:57:59,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:57:59,516 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:57:59,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 03:57:59,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 03:57:59,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:57:59,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:57:59,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:57:59,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:57:59,517 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 -> 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 [2024-10-24 03:57:59,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:57:59,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:57:59,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:57:59,898 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:57:59,900 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:57:59,901 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-10-24 03:58:01,458 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:58:01,635 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:58:01,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-10-24 03:58:01,644 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308fafc60/e3eb7723ab1a44e4a561dd4e67863e4e/FLAG8afd6f749 [2024-10-24 03:58:02,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/308fafc60/e3eb7723ab1a44e4a561dd4e67863e4e [2024-10-24 03:58:02,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:58:02,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:58:02,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:58:02,025 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:58:02,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:58:02,030 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,031 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37842a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02, skipping insertion in model container [2024-10-24 03:58:02,031 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,047 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:58:02,231 WARN L248 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.count4.c[1256,1269] [2024-10-24 03:58:02,256 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:58:02,265 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:58:02,275 WARN L248 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.count4.c[1256,1269] [2024-10-24 03:58:02,281 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:58:02,299 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:58:02,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02 WrapperNode [2024-10-24 03:58:02,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:58:02,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:58:02,302 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:58:02,302 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:58:02,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,319 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,340 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-10-24 03:58:02,341 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:58:02,342 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:58:02,342 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:58:02,342 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:58:02,352 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,352 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,359 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,371 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-10-24 03:58:02,372 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,372 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,376 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,379 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,380 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:58:02,382 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:58:02,382 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:58:02,382 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:58:02,383 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (1/1) ... [2024-10-24 03:58:02,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:58:02,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:02,418 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-10-24 03:58:02,426 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-10-24 03:58:02,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:58:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 03:58:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:58:02,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:58:02,535 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:58:02,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:58:02,750 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-10-24 03:58:02,750 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:58:02,790 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:58:02,791 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 03:58:02,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:02 BoogieIcfgContainer [2024-10-24 03:58:02,793 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:58:02,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:58:02,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:58:02,799 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:58:02,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:58:02" (1/3) ... [2024-10-24 03:58:02,800 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74da3ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:02, skipping insertion in model container [2024-10-24 03:58:02,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:02" (2/3) ... [2024-10-24 03:58:02,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74da3ba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:02, skipping insertion in model container [2024-10-24 03:58:02,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:02" (3/3) ... [2024-10-24 03:58:02,802 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count4.c [2024-10-24 03:58:02,821 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:58:02,822 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 03:58:02,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:58:02,880 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;@69ba7b0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:58:02,880 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 03:58:02,884 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 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-10-24 03:58:02,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-24 03:58:02,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:02,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-24 03:58:02,890 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:02,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1970922630, now seen corresponding path program 1 times [2024-10-24 03:58:02,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:02,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050957866] [2024-10-24 03:58:02,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:02,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:03,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:03,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050957866] [2024-10-24 03:58:03,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050957866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:58:03,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:58:03,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 03:58:03,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352183439] [2024-10-24 03:58:03,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:58:03,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 03:58:03,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:03,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 03:58:03,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 03:58:03,439 INFO L87 Difference]: Start difference. First operand has 15 states, 13 states have (on average 1.5384615384615385) internal successors, (20), 14 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) Second operand has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:03,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:03,525 INFO L93 Difference]: Finished difference Result 27 states and 38 transitions. [2024-10-24 03:58:03,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:58:03,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-24 03:58:03,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:03,534 INFO L225 Difference]: With dead ends: 27 [2024-10-24 03:58:03,535 INFO L226 Difference]: Without dead ends: 17 [2024-10-24 03:58:03,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 03:58:03,544 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:03,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 34 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:58:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-10-24 03:58:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-10-24 03:58:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 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-10-24 03:58:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2024-10-24 03:58:03,578 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 6 [2024-10-24 03:58:03,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:03,578 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2024-10-24 03:58:03,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.0) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:03,579 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2024-10-24 03:58:03,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 03:58:03,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:03,580 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:03,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 03:58:03,581 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:03,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:03,582 INFO L85 PathProgramCache]: Analyzing trace with hash 253736433, now seen corresponding path program 1 times [2024-10-24 03:58:03,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:03,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224699287] [2024-10-24 03:58:03,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:03,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:03,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:03,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224699287] [2024-10-24 03:58:03,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224699287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:03,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948332157] [2024-10-24 03:58:03,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:03,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:03,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:03,884 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:03,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 03:58:03,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:03,942 WARN L253 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-24 03:58:03,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:04,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:04,135 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948332157] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:04,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 8] total 17 [2024-10-24 03:58:04,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347657929] [2024-10-24 03:58:04,381 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:04,381 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 03:58:04,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:04,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 03:58:04,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-10-24 03:58:04,383 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:04,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:04,563 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2024-10-24 03:58:04,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 03:58:04,564 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-24 03:58:04,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:04,564 INFO L225 Difference]: With dead ends: 22 [2024-10-24 03:58:04,565 INFO L226 Difference]: Without dead ends: 20 [2024-10-24 03:58:04,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=359, Unknown=0, NotChecked=0, Total=506 [2024-10-24 03:58:04,567 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 49 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:04,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 16 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:58:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-24 03:58:04,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 17. [2024-10-24 03:58:04,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 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-10-24 03:58:04,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-10-24 03:58:04,575 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2024-10-24 03:58:04,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:04,576 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-10-24 03:58:04,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:04,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-10-24 03:58:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-24 03:58:04,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:04,577 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:04,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 03:58:04,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:04,779 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:04,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:04,779 INFO L85 PathProgramCache]: Analyzing trace with hash -670782200, now seen corresponding path program 1 times [2024-10-24 03:58:04,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:04,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217880707] [2024-10-24 03:58:04,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:04,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:04,917 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:04,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:04,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217880707] [2024-10-24 03:58:04,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217880707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:58:04,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:58:04,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 03:58:04,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452530644] [2024-10-24 03:58:04,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:58:04,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 03:58:04,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:04,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 03:58:04,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:58:04,921 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-10-24 03:58:04,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:04,963 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2024-10-24 03:58:04,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 03:58:04,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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) Word has length 12 [2024-10-24 03:58:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:04,965 INFO L225 Difference]: With dead ends: 35 [2024-10-24 03:58:04,965 INFO L226 Difference]: Without dead ends: 23 [2024-10-24 03:58:04,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 03:58:04,966 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 5 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:04,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 15 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:58:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-24 03:58:04,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2024-10-24 03:58:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2024-10-24 03:58:04,970 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 12 [2024-10-24 03:58:04,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:04,970 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2024-10-24 03:58:04,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 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-10-24 03:58:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2024-10-24 03:58:04,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 03:58:04,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:04,971 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:04,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 03:58:04,972 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:04,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:04,972 INFO L85 PathProgramCache]: Analyzing trace with hash 736681812, now seen corresponding path program 1 times [2024-10-24 03:58:04,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:04,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70838960] [2024-10-24 03:58:04,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:04,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:05,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:05,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70838960] [2024-10-24 03:58:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70838960] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1839099460] [2024-10-24 03:58:05,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:05,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:05,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:05,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:05,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 03:58:05,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:05,321 WARN L253 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-10-24 03:58:05,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:05,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:05,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:05,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1839099460] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:05,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:05,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 21 [2024-10-24 03:58:05,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269633694] [2024-10-24 03:58:05,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:05,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-24 03:58:05,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:05,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-24 03:58:05,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2024-10-24 03:58:05,941 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:06,084 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-10-24 03:58:06,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:58:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-24 03:58:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:06,085 INFO L225 Difference]: With dead ends: 39 [2024-10-24 03:58:06,085 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 03:58:06,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2024-10-24 03:58:06,086 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:06,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 42 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:58:06,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 03:58:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2024-10-24 03:58:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2024-10-24 03:58:06,090 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 13 [2024-10-24 03:58:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:06,090 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2024-10-24 03:58:06,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.5) internal successors, (33), 21 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2024-10-24 03:58:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-24 03:58:06,091 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:06,091 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:06,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-24 03:58:06,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-24 03:58:06,296 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:06,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:06,297 INFO L85 PathProgramCache]: Analyzing trace with hash -753425054, now seen corresponding path program 1 times [2024-10-24 03:58:06,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:06,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598016806] [2024-10-24 03:58:06,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:06,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:06,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:06,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598016806] [2024-10-24 03:58:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598016806] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027052419] [2024-10-24 03:58:06,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:06,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:06,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:06,560 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:06,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 03:58:06,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:06,628 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-10-24 03:58:06,630 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:06,840 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:06,840 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:06,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027052419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:06,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:06,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2024-10-24 03:58:06,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569823750] [2024-10-24 03:58:06,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:06,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 03:58:06,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:06,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 03:58:06,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-24 03:58:06,980 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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-10-24 03:58:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:07,120 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2024-10-24 03:58:07,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 03:58:07,121 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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-10-24 03:58:07,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:07,121 INFO L225 Difference]: With dead ends: 50 [2024-10-24 03:58:07,122 INFO L226 Difference]: Without dead ends: 38 [2024-10-24 03:58:07,122 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2024-10-24 03:58:07,123 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:07,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 41 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:58:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-24 03:58:07,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-24 03:58:07,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 states have internal predecessors, (42), 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-10-24 03:58:07,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-10-24 03:58:07,127 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 19 [2024-10-24 03:58:07,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:07,127 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-10-24 03:58:07,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 20 states have internal predecessors, (49), 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-10-24 03:58:07,127 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-10-24 03:58:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 03:58:07,128 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:07,128 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-24 03:58:07,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 03:58:07,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:07,329 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:07,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:07,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1825246662, now seen corresponding path program 2 times [2024-10-24 03:58:07,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:07,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299724741] [2024-10-24 03:58:07,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:07,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:07,738 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299724741] [2024-10-24 03:58:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299724741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:07,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [591082385] [2024-10-24 03:58:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 03:58:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:07,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:07,741 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:07,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 03:58:07,815 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 03:58:07,815 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:58:07,816 WARN L253 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 62 conjuncts are in the unsatisfiable core [2024-10-24 03:58:07,819 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:08,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [591082385] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:11,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:11,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 16] total 32 [2024-10-24 03:58:11,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882860070] [2024-10-24 03:58:11,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:11,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-10-24 03:58:11,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:11,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-10-24 03:58:11,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=910, Unknown=0, NotChecked=0, Total=1056 [2024-10-24 03:58:11,394 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 33 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 32 states have internal predecessors, (51), 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-10-24 03:58:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:12,126 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2024-10-24 03:58:12,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-24 03:58:12,126 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 32 states have internal predecessors, (51), 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-10-24 03:58:12,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:12,127 INFO L225 Difference]: With dead ends: 43 [2024-10-24 03:58:12,127 INFO L226 Difference]: Without dead ends: 41 [2024-10-24 03:58:12,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=207, Invalid=1275, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 03:58:12,129 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 10 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:12,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 41 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:58:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-24 03:58:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2024-10-24 03:58:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 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-10-24 03:58:12,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-10-24 03:58:12,132 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2024-10-24 03:58:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:12,133 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-10-24 03:58:12,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 32 states have internal predecessors, (51), 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-10-24 03:58:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-10-24 03:58:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-24 03:58:12,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:12,134 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:12,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-24 03:58:12,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:12,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:12,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:12,338 INFO L85 PathProgramCache]: Analyzing trace with hash -2137799809, now seen corresponding path program 1 times [2024-10-24 03:58:12,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:12,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416487350] [2024-10-24 03:58:12,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:12,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:12,502 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 03:58:12,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:12,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416487350] [2024-10-24 03:58:12,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416487350] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:12,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1616489599] [2024-10-24 03:58:12,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:12,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:12,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:12,505 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:12,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 03:58:12,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:12,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-24 03:58:12,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 03:58:12,749 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:12,837 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-10-24 03:58:12,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1616489599] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:12,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:12,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-10-24 03:58:12,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821701943] [2024-10-24 03:58:12,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:12,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-24 03:58:12,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:12,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-24 03:58:12,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 03:58:12,839 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 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-10-24 03:58:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:12,953 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2024-10-24 03:58:12,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:58:12,954 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-24 03:58:12,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:12,954 INFO L225 Difference]: With dead ends: 64 [2024-10-24 03:58:12,954 INFO L226 Difference]: Without dead ends: 52 [2024-10-24 03:58:12,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-24 03:58:12,955 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:12,956 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 27 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:58:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-24 03:58:12,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-10-24 03:58:12,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.163265306122449) internal successors, (57), 49 states have internal predecessors, (57), 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-10-24 03:58:12,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2024-10-24 03:58:12,960 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 31 [2024-10-24 03:58:12,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:12,960 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2024-10-24 03:58:12,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.9285714285714284) internal successors, (55), 13 states have internal predecessors, (55), 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-10-24 03:58:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2024-10-24 03:58:12,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 03:58:12,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:12,961 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:12,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 03:58:13,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:13,162 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:13,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1791191107, now seen corresponding path program 1 times [2024-10-24 03:58:13,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:13,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860472520] [2024-10-24 03:58:13,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:13,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:13,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:13,303 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-24 03:58:13,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860472520] [2024-10-24 03:58:13,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860472520] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:13,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368880666] [2024-10-24 03:58:13,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:13,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:13,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:13,306 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:13,307 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 03:58:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:13,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 03:58:13,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 38 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:58:13,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:13,953 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 03:58:13,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368880666] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:13,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:13,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 17 [2024-10-24 03:58:13,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221156751] [2024-10-24 03:58:13,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:13,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-24 03:58:13,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:13,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-24 03:58:13,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2024-10-24 03:58:13,955 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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-10-24 03:58:14,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:14,098 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2024-10-24 03:58:14,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 03:58:14,098 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-24 03:58:14,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:14,099 INFO L225 Difference]: With dead ends: 65 [2024-10-24 03:58:14,099 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 03:58:14,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=338, Unknown=0, NotChecked=0, Total=462 [2024-10-24 03:58:14,100 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:14,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 43 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:58:14,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 03:58:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-24 03:58:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 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-10-24 03:58:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2024-10-24 03:58:14,104 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 32 [2024-10-24 03:58:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:14,104 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2024-10-24 03:58:14,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 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-10-24 03:58:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2024-10-24 03:58:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 03:58:14,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:14,105 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:14,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 03:58:14,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:14,309 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:14,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:14,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1576286558, now seen corresponding path program 2 times [2024-10-24 03:58:14,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:14,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638281042] [2024-10-24 03:58:14,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:14,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:14,842 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:14,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:14,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638281042] [2024-10-24 03:58:14,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638281042] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:14,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706788837] [2024-10-24 03:58:14,843 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 03:58:14,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:14,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:14,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:14,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 03:58:15,159 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 03:58:15,159 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:58:15,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-10-24 03:58:15,164 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:15,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:17,157 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706788837] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:17,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:17,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 19] total 38 [2024-10-24 03:58:17,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904322676] [2024-10-24 03:58:17,158 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:17,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-24 03:58:17,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:17,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-24 03:58:17,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1258, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 03:58:17,164 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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-10-24 03:58:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:17,807 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2024-10-24 03:58:17,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-10-24 03:58:17,807 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-24 03:58:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:17,808 INFO L225 Difference]: With dead ends: 88 [2024-10-24 03:58:17,808 INFO L226 Difference]: Without dead ends: 73 [2024-10-24 03:58:17,809 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=319, Invalid=1843, Unknown=0, NotChecked=0, Total=2162 [2024-10-24 03:58:17,809 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 24 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:17,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 44 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 03:58:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-24 03:58:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2024-10-24 03:58:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 60 states have internal predecessors, (67), 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-10-24 03:58:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2024-10-24 03:58:17,815 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 33 [2024-10-24 03:58:17,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:17,815 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2024-10-24 03:58:17,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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-10-24 03:58:17,815 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2024-10-24 03:58:17,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 03:58:17,816 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:17,816 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2024-10-24 03:58:17,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-24 03:58:18,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:18,017 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:18,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:18,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1564149510, now seen corresponding path program 3 times [2024-10-24 03:58:18,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:18,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597145565] [2024-10-24 03:58:18,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:18,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:18,729 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:18,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:18,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597145565] [2024-10-24 03:58:18,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597145565] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:18,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345857904] [2024-10-24 03:58:18,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 03:58:18,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:18,733 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:18,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 03:58:18,837 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 03:58:18,837 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:58:18,838 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 03:58:18,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:19,345 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 20 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:58:19,345 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:20,700 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-10-24 03:58:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345857904] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:20,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 03:58:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11, 12] total 38 [2024-10-24 03:58:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749642675] [2024-10-24 03:58:20,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:20,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-24 03:58:20,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 03:58:20,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-24 03:58:20,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=1253, Unknown=0, NotChecked=0, Total=1482 [2024-10-24 03:58:20,702 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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-10-24 03:58:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:21,190 INFO L93 Difference]: Finished difference Result 66 states and 72 transitions. [2024-10-24 03:58:21,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-24 03:58:21,191 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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) Word has length 34 [2024-10-24 03:58:21,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:21,191 INFO L225 Difference]: With dead ends: 66 [2024-10-24 03:58:21,191 INFO L226 Difference]: Without dead ends: 64 [2024-10-24 03:58:21,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=402, Invalid=2048, Unknown=0, NotChecked=0, Total=2450 [2024-10-24 03:58:21,193 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:21,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 18 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:58:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-10-24 03:58:21,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-10-24 03:58:21,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.0634920634920635) internal successors, (67), 63 states have internal predecessors, (67), 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-10-24 03:58:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2024-10-24 03:58:21,198 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 34 [2024-10-24 03:58:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:21,198 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2024-10-24 03:58:21,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.9230769230769231) internal successors, (75), 38 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-10-24 03:58:21,199 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2024-10-24 03:58:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-24 03:58:21,200 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:21,200 INFO L215 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2024-10-24 03:58:21,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-24 03:58:21,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-24 03:58:21,401 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:21,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:21,401 INFO L85 PathProgramCache]: Analyzing trace with hash 787380514, now seen corresponding path program 3 times [2024-10-24 03:58:21,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 03:58:21,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123270997] [2024-10-24 03:58:21,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:21,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 03:58:21,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 23 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 03:58:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123270997] [2024-10-24 03:58:22,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123270997] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 03:58:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704893595] [2024-10-24 03:58:22,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 03:58:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:22,855 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 03:58:22,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 03:58:23,155 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2024-10-24 03:58:23,156 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:58:23,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 136 conjuncts are in the unsatisfiable core [2024-10-24 03:58:23,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:37,689 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-10-24 03:58:37,690 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-10-24 03:58:37,699 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 101 [2024-10-24 03:58:37,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-24 03:58:37,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 03:58:37,892 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.parseSuccess(Executor.java:277) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:140) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:86) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:947) 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.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:195) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:290) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) 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:421) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:307) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:141) 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) ... 46 more [2024-10-24 03:58:37,901 INFO L158 Benchmark]: Toolchain (without parser) took 35876.78ms. Allocated memory was 153.1MB in the beginning and 450.9MB in the end (delta: 297.8MB). Free memory was 80.6MB in the beginning and 337.0MB in the end (delta: -256.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-24 03:58:37,901 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:58:37,901 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.08ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 67.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-24 03:58:37,901 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.48ms. Allocated memory is still 153.1MB. Free memory was 67.8MB in the beginning and 65.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:58:37,901 INFO L158 Benchmark]: Boogie Preprocessor took 39.70ms. Allocated memory is still 153.1MB. Free memory was 65.6MB in the beginning and 63.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:58:37,902 INFO L158 Benchmark]: RCFGBuilder took 410.77ms. Allocated memory is still 153.1MB. Free memory was 63.7MB in the beginning and 121.1MB in the end (delta: -57.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-24 03:58:37,902 INFO L158 Benchmark]: TraceAbstraction took 35105.85ms. Allocated memory was 153.1MB in the beginning and 450.9MB in the end (delta: 297.8MB). Free memory was 121.1MB in the beginning and 337.0MB in the end (delta: -215.8MB). Peak memory consumption was 81.7MB. Max. memory is 16.1GB. [2024-10-24 03:58:37,903 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 153.1MB. Free memory is still 111.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.08ms. Allocated memory is still 153.1MB. Free memory was 80.4MB in the beginning and 67.8MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.48ms. Allocated memory is still 153.1MB. Free memory was 67.8MB in the beginning and 65.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.70ms. Allocated memory is still 153.1MB. Free memory was 65.6MB in the beginning and 63.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 410.77ms. Allocated memory is still 153.1MB. Free memory was 63.7MB in the beginning and 121.1MB in the end (delta: -57.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 35105.85ms. Allocated memory was 153.1MB in the beginning and 450.9MB in the end (delta: 297.8MB). Free memory was 121.1MB in the beginning and 337.0MB in the end (delta: -215.8MB). Peak memory consumption was 81.7MB. 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 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.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 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 03:58:40,477 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 03:58:40,520 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-24 03:58:40,524 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 03:58:40,524 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 03:58:40,542 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 03:58:40,543 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 03:58:40,543 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 03:58:40,543 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 03:58:40,544 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 03:58:40,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 03:58:40,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 03:58:40,545 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 03:58:40,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 03:58:40,546 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 03:58:40,546 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 03:58:40,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 03:58:40,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 03:58:40,547 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 03:58:40,547 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 03:58:40,547 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 03:58:40,552 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 03:58:40,552 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 03:58:40,552 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 03:58:40,553 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 03:58:40,553 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 03:58:40,553 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 03:58:40,553 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 03:58:40,554 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 03:58:40,554 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 03:58:40,554 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 03:58:40,554 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:58:40,555 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 03:58:40,555 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 03:58:40,555 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 03:58:40,556 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 03:58:40,556 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 03:58:40,556 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 03:58:40,556 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 03:58:40,557 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 03:58:40,557 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 03:58:40,557 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 03:58:40,558 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 -> 7520cfa04676a157cc3b0d71c42a9ed73acdf0d120a939e33f1a3e61a093ef11 [2024-10-24 03:58:40,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 03:58:40,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 03:58:40,858 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 03:58:40,863 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 03:58:40,863 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 03:58:40,865 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-10-24 03:58:42,409 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 03:58:42,610 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 03:58:42,610 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count4.c [2024-10-24 03:58:42,619 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081c70054/234a1d903e9f4614b2a6ca269f2a5f4d/FLAG713e4285a [2024-10-24 03:58:42,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/081c70054/234a1d903e9f4614b2a6ca269f2a5f4d [2024-10-24 03:58:42,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 03:58:42,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 03:58:42,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 03:58:42,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 03:58:42,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 03:58:42,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555265c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42, skipping insertion in model container [2024-10-24 03:58:42,647 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,666 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 03:58:42,800 WARN L248 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.count4.c[1256,1269] [2024-10-24 03:58:42,827 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:58:42,846 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 03:58:42,860 WARN L248 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.count4.c[1256,1269] [2024-10-24 03:58:42,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 03:58:42,897 INFO L204 MainTranslator]: Completed translation [2024-10-24 03:58:42,898 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42 WrapperNode [2024-10-24 03:58:42,898 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 03:58:42,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 03:58:42,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 03:58:42,900 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 03:58:42,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,917 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,936 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2024-10-24 03:58:42,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 03:58:42,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 03:58:42,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 03:58:42,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 03:58:42,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,956 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,972 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-10-24 03:58:42,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,975 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,986 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,987 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 03:58:42,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 03:58:42,993 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 03:58:42,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 03:58:42,993 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (1/1) ... [2024-10-24 03:58:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 03:58:43,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 03:58:43,025 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-10-24 03:58:43,031 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-10-24 03:58:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 03:58:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 03:58:43,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 03:58:43,089 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 03:58:43,148 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 03:58:43,150 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 03:58:43,270 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 03:58:43,273 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 03:58:43,310 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 03:58:43,312 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 03:58:43,312 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:43 BoogieIcfgContainer [2024-10-24 03:58:43,312 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 03:58:43,315 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 03:58:43,316 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 03:58:43,318 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 03:58:43,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:58:42" (1/3) ... [2024-10-24 03:58:43,319 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398164ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:43, skipping insertion in model container [2024-10-24 03:58:43,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:58:42" (2/3) ... [2024-10-24 03:58:43,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@398164ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:58:43, skipping insertion in model container [2024-10-24 03:58:43,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:43" (3/3) ... [2024-10-24 03:58:43,321 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count4.c [2024-10-24 03:58:43,335 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 03:58:43,336 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 03:58:43,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 03:58:43,395 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;@c122fba, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 03:58:43,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 03:58:43,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-24 03:58:43,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 03:58:43,405 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:43,406 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 03:58:43,407 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:43,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:43,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-24 03:58:43,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:58:43,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [779124612] [2024-10-24 03:58:43,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:43,425 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-10-24 03:58:43,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:58:43,431 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-10-24 03:58:43,446 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-10-24 03:58:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:43,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-24 03:58:43,496 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:43,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:43,582 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 03:58:43,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:58:43,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [779124612] [2024-10-24 03:58:43,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [779124612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 03:58:43,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 03:58:43,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 03:58:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031251933] [2024-10-24 03:58:43,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 03:58:43,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 03:58:43,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:58:43,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 03:58:43,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 03:58:43,613 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-24 03:58:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:43,681 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-24 03:58:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 03:58:43,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-24 03:58:43,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:43,689 INFO L225 Difference]: With dead ends: 15 [2024-10-24 03:58:43,689 INFO L226 Difference]: Without dead ends: 9 [2024-10-24 03:58:43,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-24 03:58:43,693 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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-10-24 03:58:43,696 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:58:43,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-24 03:58:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-24 03:58:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-24 03:58:43,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-24 03:58:43,719 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-24 03:58:43,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:43,719 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-24 03:58:43,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-24 03:58:43,720 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-24 03:58:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-24 03:58:43,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:43,720 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-24 03:58:43,727 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 03:58:43,922 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-10-24 03:58:43,924 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:43,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:43,925 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-24 03:58:43,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:58:43,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [369552975] [2024-10-24 03:58:43,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 03:58:43,927 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-10-24 03:58:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:58:43,931 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-10-24 03:58:43,954 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-10-24 03:58:43,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 03:58:43,988 INFO L255 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-24 03:58:43,991 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:44,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:44,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:44,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:44,172 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:58:44,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [369552975] [2024-10-24 03:58:44,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [369552975] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:44,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 03:58:44,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-24 03:58:44,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057660570] [2024-10-24 03:58:44,176 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:44,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 03:58:44,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:58:44,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 03:58:44,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 03:58:44,178 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:44,271 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2024-10-24 03:58:44,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 03:58:44,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-24 03:58:44,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:44,272 INFO L225 Difference]: With dead ends: 17 [2024-10-24 03:58:44,272 INFO L226 Difference]: Without dead ends: 15 [2024-10-24 03:58:44,272 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:58:44,273 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:44,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 11 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 03:58:44,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-10-24 03:58:44,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2024-10-24 03:58:44,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 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-10-24 03:58:44,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2024-10-24 03:58:44,277 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2024-10-24 03:58:44,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:44,277 INFO L471 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2024-10-24 03:58:44,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 03:58:44,277 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2024-10-24 03:58:44,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-24 03:58:44,278 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:44,278 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1] [2024-10-24 03:58:44,280 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-10-24 03:58:44,479 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-10-24 03:58:44,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:44,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:44,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1748931734, now seen corresponding path program 2 times [2024-10-24 03:58:44,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:58:44,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941489458] [2024-10-24 03:58:44,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 03:58:44,483 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-10-24 03:58:44,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:58:44,486 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-10-24 03:58:44,487 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-10-24 03:58:44,544 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 03:58:44,544 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:58:44,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-24 03:58:44,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:44,714 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:44,714 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:44,835 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:44,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:58:44,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941489458] [2024-10-24 03:58:44,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941489458] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:44,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 03:58:44,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-24 03:58:44,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343100050] [2024-10-24 03:58:44,837 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:44,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 03:58:44,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:58:44,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 03:58:44,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-10-24 03:58:44,838 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-24 03:58:45,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:45,181 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2024-10-24 03:58:45,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 03:58:45,186 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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 13 [2024-10-24 03:58:45,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:45,186 INFO L225 Difference]: With dead ends: 29 [2024-10-24 03:58:45,187 INFO L226 Difference]: Without dead ends: 27 [2024-10-24 03:58:45,188 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-10-24 03:58:45,188 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:45,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 19 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 03:58:45,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-24 03:58:45,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2024-10-24 03:58:45,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 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-10-24 03:58:45,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2024-10-24 03:58:45,204 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2024-10-24 03:58:45,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:45,205 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2024-10-24 03:58:45,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 11 states have internal predecessors, (25), 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-10-24 03:58:45,205 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2024-10-24 03:58:45,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 03:58:45,212 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:45,212 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1] [2024-10-24 03:58:45,218 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-10-24 03:58:45,412 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-10-24 03:58:45,413 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:45,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:45,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1505384042, now seen corresponding path program 3 times [2024-10-24 03:58:45,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:58:45,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30380783] [2024-10-24 03:58:45,415 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 03:58:45,416 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-10-24 03:58:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:58:45,419 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-10-24 03:58:45,420 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-10-24 03:58:45,480 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-10-24 03:58:45,480 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 03:58:45,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-24 03:58:45,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 03:58:45,882 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:45,883 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 03:58:46,221 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 03:58:46,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 03:58:46,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30380783] [2024-10-24 03:58:46,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [30380783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 03:58:46,222 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 03:58:46,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2024-10-24 03:58:46,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768375634] [2024-10-24 03:58:46,223 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 03:58:46,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 03:58:46,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 03:58:46,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 03:58:46,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-10-24 03:58:46,224 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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-10-24 03:58:47,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 03:58:47,287 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2024-10-24 03:58:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-10-24 03:58:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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 25 [2024-10-24 03:58:47,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 03:58:47,289 INFO L225 Difference]: With dead ends: 53 [2024-10-24 03:58:47,289 INFO L226 Difference]: Without dead ends: 51 [2024-10-24 03:58:47,289 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=515, Invalid=1207, Unknown=0, NotChecked=0, Total=1722 [2024-10-24 03:58:47,290 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 03:58:47,290 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 03:58:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-24 03:58:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-24 03:58:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 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-10-24 03:58:47,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2024-10-24 03:58:47,305 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 25 [2024-10-24 03:58:47,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 03:58:47,305 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2024-10-24 03:58:47,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.45) internal successors, (49), 19 states have internal predecessors, (49), 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-10-24 03:58:47,306 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2024-10-24 03:58:47,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 03:58:47,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 03:58:47,306 INFO L215 NwaCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1] [2024-10-24 03:58:47,313 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-10-24 03:58:47,507 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-10-24 03:58:47,508 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 03:58:47,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 03:58:47,508 INFO L85 PathProgramCache]: Analyzing trace with hash 548230038, now seen corresponding path program 4 times [2024-10-24 03:58:47,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 03:58:47,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [643451382] [2024-10-24 03:58:47,509 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-24 03:58:47,509 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-10-24 03:58:47,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 03:58:47,511 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-10-24 03:58:47,512 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-10-24 03:58:47,612 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-24 03:58:47,613 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-24 03:58:47,613 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 03:58:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 03:58:47,712 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-24 03:58:47,712 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 03:58:47,713 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 03:58:47,720 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-10-24 03:58:47,915 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-10-24 03:58:47,918 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1] [2024-10-24 03:58:47,944 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 03:58:47,948 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:58:47 BoogieIcfgContainer [2024-10-24 03:58:47,948 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 03:58:47,948 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 03:58:47,949 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 03:58:47,949 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 03:58:47,949 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:58:43" (3/4) ... [2024-10-24 03:58:47,950 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-24 03:58:48,073 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 03:58:48,073 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 03:58:48,073 INFO L158 Benchmark]: Toolchain (without parser) took 5437.25ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 63.2MB in the beginning and 109.7MB in the end (delta: -46.5MB). Peak memory consumption was 33.3MB. Max. memory is 16.1GB. [2024-10-24 03:58:48,074 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 41.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:58:48,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 261.50ms. Allocated memory is still 90.2MB. Free memory was 63.0MB in the beginning and 50.2MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 03:58:48,074 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.79ms. Allocated memory is still 90.2MB. Free memory was 50.2MB in the beginning and 48.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 03:58:48,074 INFO L158 Benchmark]: Boogie Preprocessor took 52.26ms. Allocated memory is still 90.2MB. Free memory was 48.6MB in the beginning and 46.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 03:58:48,074 INFO L158 Benchmark]: RCFGBuilder took 319.88ms. Allocated memory is still 90.2MB. Free memory was 46.7MB in the beginning and 59.8MB in the end (delta: -13.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 03:58:48,074 INFO L158 Benchmark]: TraceAbstraction took 4632.81ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 59.1MB in the beginning and 80.1MB in the end (delta: -21.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. [2024-10-24 03:58:48,075 INFO L158 Benchmark]: Witness Printer took 124.65ms. Allocated memory is still 136.3MB. Free memory was 80.1MB in the beginning and 109.7MB in the end (delta: -29.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 03:58:48,080 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 62.9MB. Free memory was 42.0MB in the beginning and 41.9MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 261.50ms. Allocated memory is still 90.2MB. Free memory was 63.0MB in the beginning and 50.2MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.79ms. Allocated memory is still 90.2MB. Free memory was 50.2MB in the beginning and 48.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 52.26ms. Allocated memory is still 90.2MB. Free memory was 48.6MB in the beginning and 46.7MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 319.88ms. Allocated memory is still 90.2MB. Free memory was 46.7MB in the beginning and 59.8MB in the end (delta: -13.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4632.81ms. Allocated memory was 90.2MB in the beginning and 136.3MB in the end (delta: 46.1MB). Free memory was 59.1MB in the beginning and 80.1MB in the end (delta: -21.0MB). Peak memory consumption was 25.1MB. Max. memory is 16.1GB. * Witness Printer took 124.65ms. Allocated memory is still 136.3MB. Free memory was 80.1MB in the beginning and 109.7MB in the end (delta: -29.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 4); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (4 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [mask_SORT_1=15, state_3=0, var_5=1, var_8=15] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 370 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 8 mSDtfsCounter, 370 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=4, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 4 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 87 ConstructedInterpolants, 0 QuantifiedInterpolants, 1754 SizeOfPredicates, 15 NumberOfNonLiveVariables, 184 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/188 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 proved your program to be incorrect! [2024-10-24 03:58:48,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE