./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.h_segments.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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.h_segments.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 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:21:53,559 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:21:53,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 06:21:53,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:21:53,668 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:21:53,704 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:21:53,707 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:21:53,707 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:21:53,708 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:21:53,708 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:21:53,709 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:21:53,709 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:21:53,710 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:21:53,712 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:21:53,713 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:21:53,713 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:21:53,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:21:53,718 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 06:21:53,719 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:21:53,719 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:21:53,719 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:21:53,720 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:21:53,721 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:21:53,721 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:21:53,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:21:53,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:21:53,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:21:53,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:21:53,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:21:53,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:21:53,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:21:53,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:21:53,724 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:21:53,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 06:21:53,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 06:21:53,728 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:21:53,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:21:53,729 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:21:53,729 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:21:53,730 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 -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-10-14 06:21:54,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:21:54,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:21:54,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:21:54,068 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:21:54,069 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:21:54,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-10-14 06:21:55,644 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:21:55,897 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:21:55,898 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-10-14 06:21:55,913 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3510367d7/6b8d25faeebc4683b1977be69d8caa0b/FLAG746258b67 [2024-10-14 06:21:55,932 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3510367d7/6b8d25faeebc4683b1977be69d8caa0b [2024-10-14 06:21:55,934 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:21:55,936 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:21:55,938 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:21:55,938 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:21:55,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:21:55,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:21:55" (1/1) ... [2024-10-14 06:21:55,949 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c08d763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:55, skipping insertion in model container [2024-10-14 06:21:55,949 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:21:55" (1/1) ... [2024-10-14 06:21:55,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:21:56,158 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.h_segments.c[1250,1263] [2024-10-14 06:21:56,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:21:56,270 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:21:56,289 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.h_segments.c[1250,1263] [2024-10-14 06:21:56,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:21:56,357 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:21:56,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56 WrapperNode [2024-10-14 06:21:56,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:21:56,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:21:56,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:21:56,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:21:56,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,414 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,487 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 308 [2024-10-14 06:21:56,487 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:21:56,488 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:21:56,488 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:21:56,489 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:21:56,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,511 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,554 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-14 06:21:56,555 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,555 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,590 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,597 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,612 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:21:56,615 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:21:56,615 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:21:56,615 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:21:56,616 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (1/1) ... [2024-10-14 06:21:56,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:21:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:21:56,654 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-14 06:21:56,660 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-14 06:21:56,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:21:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 06:21:56,730 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:21:56,730 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:21:56,857 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:21:56,859 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:21:57,502 INFO L? ?]: Removed 175 outVars from TransFormulas that were not future-live. [2024-10-14 06:21:57,502 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:21:57,544 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:21:57,544 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:21:57,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:21:57 BoogieIcfgContainer [2024-10-14 06:21:57,546 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:21:57,549 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:21:57,549 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:21:57,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:21:57,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:21:55" (1/3) ... [2024-10-14 06:21:57,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711bd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:21:57, skipping insertion in model container [2024-10-14 06:21:57,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:21:56" (2/3) ... [2024-10-14 06:21:57,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7711bd1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:21:57, skipping insertion in model container [2024-10-14 06:21:57,556 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:21:57" (3/3) ... [2024-10-14 06:21:57,557 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-10-14 06:21:57,577 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:21:57,578 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:21:57,662 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:21:57,669 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;@1ba68cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:21:57,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:21:57,676 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 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-14 06:21:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 06:21:57,684 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:57,685 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:57,687 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:57,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1339395457, now seen corresponding path program 1 times [2024-10-14 06:21:57,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:57,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033074501] [2024-10-14 06:21:57,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:58,498 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-14 06:21:58,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:58,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033074501] [2024-10-14 06:21:58,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033074501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:58,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:58,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:58,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705050344] [2024-10-14 06:21:58,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:58,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:21:58,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:58,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:21:58,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:58,536 INFO L87 Difference]: Start difference. First operand has 79 states, 77 states have (on average 1.5064935064935066) internal successors, (116), 78 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:58,609 INFO L93 Difference]: Finished difference Result 154 states and 228 transitions. [2024-10-14 06:21:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:21:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 06:21:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:58,623 INFO L225 Difference]: With dead ends: 154 [2024-10-14 06:21:58,623 INFO L226 Difference]: Without dead ends: 80 [2024-10-14 06:21:58,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:58,631 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:58,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:21:58,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-14 06:21:58,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-10-14 06:21:58,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 79 states have internal predecessors, (116), 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-14 06:21:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 116 transitions. [2024-10-14 06:21:58,666 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 116 transitions. Word has length 30 [2024-10-14 06:21:58,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:58,667 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 116 transitions. [2024-10-14 06:21:58,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 4 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:58,667 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 116 transitions. [2024-10-14 06:21:58,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 06:21:58,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:58,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:58,669 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 06:21:58,669 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:58,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:58,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1426718471, now seen corresponding path program 1 times [2024-10-14 06:21:58,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:58,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970953748] [2024-10-14 06:21:58,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:58,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:58,952 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-14 06:21:58,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:58,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970953748] [2024-10-14 06:21:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970953748] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:58,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:21:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346340096] [2024-10-14 06:21:58,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:58,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:21:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:58,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:21:58,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:58,960 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:59,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:59,003 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2024-10-14 06:21:59,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:21:59,004 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-10-14 06:21:59,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:59,006 INFO L225 Difference]: With dead ends: 157 [2024-10-14 06:21:59,006 INFO L226 Difference]: Without dead ends: 82 [2024-10-14 06:21:59,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:21:59,008 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:59,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 325 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:21:59,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-14 06:21:59,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-14 06:21:59,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.4567901234567902) internal successors, (118), 81 states have internal predecessors, (118), 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-14 06:21:59,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 118 transitions. [2024-10-14 06:21:59,017 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 118 transitions. Word has length 31 [2024-10-14 06:21:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:59,018 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 118 transitions. [2024-10-14 06:21:59,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:59,019 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2024-10-14 06:21:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-14 06:21:59,020 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:59,020 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:59,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 06:21:59,020 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:59,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:59,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1918401882, now seen corresponding path program 1 times [2024-10-14 06:21:59,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:59,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391314068] [2024-10-14 06:21:59,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:59,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:21:59,458 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-14 06:21:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:21:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391314068] [2024-10-14 06:21:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391314068] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:21:59,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:21:59,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 06:21:59,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902025034] [2024-10-14 06:21:59,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:21:59,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 06:21:59,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:21:59,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 06:21:59,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 06:21:59,463 INFO L87 Difference]: Start difference. First operand 82 states and 118 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:21:59,574 INFO L93 Difference]: Finished difference Result 163 states and 235 transitions. [2024-10-14 06:21:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:21:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-10-14 06:21:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:21:59,579 INFO L225 Difference]: With dead ends: 163 [2024-10-14 06:21:59,579 INFO L226 Difference]: Without dead ends: 86 [2024-10-14 06:21:59,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:21:59,580 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 96 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:21:59,581 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 411 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:21:59,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-14 06:21:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2024-10-14 06:21:59,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 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-14 06:21:59,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-10-14 06:21:59,595 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 32 [2024-10-14 06:21:59,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:21:59,596 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-14 06:21:59,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:21:59,596 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-10-14 06:21:59,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 06:21:59,597 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:21:59,597 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:21:59,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 06:21:59,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:21:59,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:21:59,599 INFO L85 PathProgramCache]: Analyzing trace with hash 905461468, now seen corresponding path program 1 times [2024-10-14 06:21:59,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:21:59,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808354021] [2024-10-14 06:21:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:21:59,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:21:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:00,595 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-14 06:22:00,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:00,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808354021] [2024-10-14 06:22:00,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808354021] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:00,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:00,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 06:22:00,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609348320] [2024-10-14 06:22:00,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:00,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 06:22:00,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:00,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 06:22:00,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:22:00,601 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 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-14 06:22:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:00,716 INFO L93 Difference]: Finished difference Result 173 states and 247 transitions. [2024-10-14 06:22:00,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 06:22:00,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-10-14 06:22:00,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:00,720 INFO L225 Difference]: With dead ends: 173 [2024-10-14 06:22:00,722 INFO L226 Difference]: Without dead ends: 93 [2024-10-14 06:22:00,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:22:00,724 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 122 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:00,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 528 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:22:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-10-14 06:22:00,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2024-10-14 06:22:00,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.4269662921348314) internal successors, (127), 89 states have internal predecessors, (127), 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-14 06:22:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2024-10-14 06:22:00,737 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 33 [2024-10-14 06:22:00,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:00,738 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2024-10-14 06:22:00,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 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-14 06:22:00,738 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2024-10-14 06:22:00,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 06:22:00,739 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:00,740 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:00,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 06:22:00,741 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:00,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1031745068, now seen corresponding path program 1 times [2024-10-14 06:22:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:00,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871029115] [2024-10-14 06:22:00,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:00,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:01,257 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-14 06:22:01,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:01,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871029115] [2024-10-14 06:22:01,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871029115] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:01,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:01,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 06:22:01,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396050101] [2024-10-14 06:22:01,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:01,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:22:01,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:01,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:22:01,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:22:01,264 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:01,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:01,350 INFO L93 Difference]: Finished difference Result 184 states and 260 transitions. [2024-10-14 06:22:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:22:01,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-14 06:22:01,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:01,353 INFO L225 Difference]: With dead ends: 184 [2024-10-14 06:22:01,353 INFO L226 Difference]: Without dead ends: 99 [2024-10-14 06:22:01,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-14 06:22:01,356 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 117 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:01,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 513 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:22:01,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-14 06:22:01,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2024-10-14 06:22:01,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 93 states have internal predecessors, (132), 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-14 06:22:01,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 132 transitions. [2024-10-14 06:22:01,374 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 132 transitions. Word has length 34 [2024-10-14 06:22:01,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:01,375 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 132 transitions. [2024-10-14 06:22:01,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 7 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:01,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 132 transitions. [2024-10-14 06:22:01,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 06:22:01,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:01,376 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:01,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 06:22:01,377 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:01,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:01,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1296075461, now seen corresponding path program 1 times [2024-10-14 06:22:01,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:01,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539403996] [2024-10-14 06:22:01,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:01,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:01,524 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-14 06:22:01,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:01,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539403996] [2024-10-14 06:22:01,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539403996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:01,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:01,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:22:01,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003434626] [2024-10-14 06:22:01,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:01,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:22:01,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:01,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:22:01,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:22:01,531 INFO L87 Difference]: Start difference. First operand 94 states and 132 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:01,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:01,593 INFO L93 Difference]: Finished difference Result 266 states and 373 transitions. [2024-10-14 06:22:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:22:01,594 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-14 06:22:01,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:01,596 INFO L225 Difference]: With dead ends: 266 [2024-10-14 06:22:01,597 INFO L226 Difference]: Without dead ends: 177 [2024-10-14 06:22:01,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:22:01,599 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 301 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:01,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 307 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:01,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-10-14 06:22:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 106. [2024-10-14 06:22:01,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 105 states have internal predecessors, (148), 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-14 06:22:01,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 148 transitions. [2024-10-14 06:22:01,618 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 148 transitions. Word has length 34 [2024-10-14 06:22:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:01,618 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 148 transitions. [2024-10-14 06:22:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:01,619 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 148 transitions. [2024-10-14 06:22:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-14 06:22:01,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:01,620 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 06:22:01,620 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:01,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1914512670, now seen corresponding path program 1 times [2024-10-14 06:22:01,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:01,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605035966] [2024-10-14 06:22:01,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:01,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:01,765 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-14 06:22:01,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:01,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605035966] [2024-10-14 06:22:01,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605035966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:01,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:01,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:22:01,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993388907] [2024-10-14 06:22:01,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:01,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:22:01,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:01,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:22:01,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:22:01,770 INFO L87 Difference]: Start difference. First operand 106 states and 148 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:01,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:01,832 INFO L93 Difference]: Finished difference Result 260 states and 362 transitions. [2024-10-14 06:22:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:22:01,833 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-10-14 06:22:01,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:01,834 INFO L225 Difference]: With dead ends: 260 [2024-10-14 06:22:01,834 INFO L226 Difference]: Without dead ends: 167 [2024-10-14 06:22:01,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:22:01,838 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 289 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:01,839 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 307 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:01,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-14 06:22:01,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 102. [2024-10-14 06:22:01,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 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-14 06:22:01,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 142 transitions. [2024-10-14 06:22:01,854 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 142 transitions. Word has length 34 [2024-10-14 06:22:01,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:01,854 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 142 transitions. [2024-10-14 06:22:01,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:01,855 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 142 transitions. [2024-10-14 06:22:01,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-14 06:22:01,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:01,856 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:01,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 06:22:01,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:01,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:01,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1037232362, now seen corresponding path program 1 times [2024-10-14 06:22:01,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:01,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848442498] [2024-10-14 06:22:01,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:01,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:02,416 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-14 06:22:02,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:02,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848442498] [2024-10-14 06:22:02,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848442498] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:02,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:02,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 06:22:02,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623155072] [2024-10-14 06:22:02,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:02,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 06:22:02,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:02,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 06:22:02,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-10-14 06:22:02,422 INFO L87 Difference]: Start difference. First operand 102 states and 142 transitions. Second operand has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:02,568 INFO L93 Difference]: Finished difference Result 206 states and 289 transitions. [2024-10-14 06:22:02,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 06:22:02,568 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-10-14 06:22:02,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:02,569 INFO L225 Difference]: With dead ends: 206 [2024-10-14 06:22:02,570 INFO L226 Difference]: Without dead ends: 117 [2024-10-14 06:22:02,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 06:22:02,571 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 125 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:02,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 775 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:22:02,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-14 06:22:02,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2024-10-14 06:22:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.4090909090909092) internal successors, (155), 110 states have internal predecessors, (155), 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-14 06:22:02,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 155 transitions. [2024-10-14 06:22:02,587 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 155 transitions. Word has length 35 [2024-10-14 06:22:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:02,587 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 155 transitions. [2024-10-14 06:22:02,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 10 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 155 transitions. [2024-10-14 06:22:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:22:02,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:02,588 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:02,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 06:22:02,589 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:02,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:02,590 INFO L85 PathProgramCache]: Analyzing trace with hash 444693754, now seen corresponding path program 1 times [2024-10-14 06:22:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033036698] [2024-10-14 06:22:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:03,229 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-14 06:22:03,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:03,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033036698] [2024-10-14 06:22:03,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033036698] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:03,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:03,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 06:22:03,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935036857] [2024-10-14 06:22:03,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:03,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 06:22:03,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:03,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 06:22:03,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-10-14 06:22:03,232 INFO L87 Difference]: Start difference. First operand 111 states and 155 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 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-14 06:22:03,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:03,444 INFO L93 Difference]: Finished difference Result 223 states and 313 transitions. [2024-10-14 06:22:03,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 06:22:03,445 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 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 36 [2024-10-14 06:22:03,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:03,446 INFO L225 Difference]: With dead ends: 223 [2024-10-14 06:22:03,446 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 06:22:03,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-10-14 06:22:03,447 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 130 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:03,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1098 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 06:22:03,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 06:22:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 119. [2024-10-14 06:22:03,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.4067796610169492) internal successors, (166), 118 states have internal predecessors, (166), 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-14 06:22:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 166 transitions. [2024-10-14 06:22:03,453 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 166 transitions. Word has length 36 [2024-10-14 06:22:03,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:03,454 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 166 transitions. [2024-10-14 06:22:03,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 13 states have internal predecessors, (36), 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-14 06:22:03,454 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 166 transitions. [2024-10-14 06:22:03,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:22:03,455 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:03,455 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:03,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 06:22:03,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:03,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:03,456 INFO L85 PathProgramCache]: Analyzing trace with hash -210964546, now seen corresponding path program 1 times [2024-10-14 06:22:03,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:03,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341392861] [2024-10-14 06:22:03,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:03,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:04,037 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-14 06:22:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341392861] [2024-10-14 06:22:04,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341392861] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:04,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:04,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 06:22:04,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406820498] [2024-10-14 06:22:04,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:04,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 06:22:04,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:04,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 06:22:04,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-10-14 06:22:04,040 INFO L87 Difference]: Start difference. First operand 119 states and 166 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-14 06:22:04,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:04,371 INFO L93 Difference]: Finished difference Result 250 states and 350 transitions. [2024-10-14 06:22:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 06:22:04,372 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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 36 [2024-10-14 06:22:04,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:04,375 INFO L225 Difference]: With dead ends: 250 [2024-10-14 06:22:04,375 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 06:22:04,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2024-10-14 06:22:04,376 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 123 mSDsluCounter, 1147 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1237 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:04,377 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1237 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 06:22:04,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 06:22:04,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2024-10-14 06:22:04,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 1.411764705882353) internal successors, (192), 136 states have internal predecessors, (192), 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-14 06:22:04,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 192 transitions. [2024-10-14 06:22:04,392 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 192 transitions. Word has length 36 [2024-10-14 06:22:04,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:04,392 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 192 transitions. [2024-10-14 06:22:04,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-14 06:22:04,393 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 192 transitions. [2024-10-14 06:22:04,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:22:04,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:04,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:04,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 06:22:04,394 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:04,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:04,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1071844009, now seen corresponding path program 1 times [2024-10-14 06:22:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862074360] [2024-10-14 06:22:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:04,541 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-14 06:22:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862074360] [2024-10-14 06:22:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862074360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:04,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:22:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219912732] [2024-10-14 06:22:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:04,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:22:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:22:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:22:04,544 INFO L87 Difference]: Start difference. First operand 137 states and 192 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-14 06:22:04,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:04,603 INFO L93 Difference]: Finished difference Result 346 states and 483 transitions. [2024-10-14 06:22:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:22:04,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-10-14 06:22:04,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:04,605 INFO L225 Difference]: With dead ends: 346 [2024-10-14 06:22:04,605 INFO L226 Difference]: Without dead ends: 222 [2024-10-14 06:22:04,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:22:04,607 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 269 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:04,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 307 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-10-14 06:22:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 156. [2024-10-14 06:22:04,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 155 states have (on average 1.3870967741935485) internal successors, (215), 155 states have internal predecessors, (215), 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-14 06:22:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 215 transitions. [2024-10-14 06:22:04,618 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 215 transitions. Word has length 36 [2024-10-14 06:22:04,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:04,618 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 215 transitions. [2024-10-14 06:22:04,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-14 06:22:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 215 transitions. [2024-10-14 06:22:04,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:22:04,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:04,621 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:04,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 06:22:04,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:04,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:04,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1326077137, now seen corresponding path program 1 times [2024-10-14 06:22:04,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:04,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277449239] [2024-10-14 06:22:04,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:04,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:05,195 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-14 06:22:05,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:05,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277449239] [2024-10-14 06:22:05,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277449239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:05,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:05,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 06:22:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772566725] [2024-10-14 06:22:05,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:05,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:22:05,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:22:05,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:22:05,197 INFO L87 Difference]: Start difference. First operand 156 states and 215 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-14 06:22:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:05,269 INFO L93 Difference]: Finished difference Result 280 states and 390 transitions. [2024-10-14 06:22:05,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 06:22:05,270 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2024-10-14 06:22:05,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:05,271 INFO L225 Difference]: With dead ends: 280 [2024-10-14 06:22:05,271 INFO L226 Difference]: Without dead ends: 153 [2024-10-14 06:22:05,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:22:05,272 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 9 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:05,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 605 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:22:05,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-10-14 06:22:05,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2024-10-14 06:22:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 152 states have (on average 1.381578947368421) internal successors, (210), 152 states have internal predecessors, (210), 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-14 06:22:05,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 210 transitions. [2024-10-14 06:22:05,283 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 210 transitions. Word has length 36 [2024-10-14 06:22:05,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:05,284 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 210 transitions. [2024-10-14 06:22:05,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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-14 06:22:05,284 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 210 transitions. [2024-10-14 06:22:05,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-10-14 06:22:05,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:05,285 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:05,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 06:22:05,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:05,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:05,287 INFO L85 PathProgramCache]: Analyzing trace with hash 571310533, now seen corresponding path program 1 times [2024-10-14 06:22:05,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:05,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482868603] [2024-10-14 06:22:05,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:05,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:05,398 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-14 06:22:05,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:05,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482868603] [2024-10-14 06:22:05,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482868603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:05,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:05,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:22:05,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238050686] [2024-10-14 06:22:05,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:05,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:22:05,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:05,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:22:05,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:22:05,401 INFO L87 Difference]: Start difference. First operand 153 states and 210 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-14 06:22:05,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:05,457 INFO L93 Difference]: Finished difference Result 337 states and 465 transitions. [2024-10-14 06:22:05,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:22:05,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2024-10-14 06:22:05,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:05,459 INFO L225 Difference]: With dead ends: 337 [2024-10-14 06:22:05,460 INFO L226 Difference]: Without dead ends: 204 [2024-10-14 06:22:05,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:22:05,461 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 258 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:05,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 307 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:05,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-14 06:22:05,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 147. [2024-10-14 06:22:05,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.3767123287671232) internal successors, (201), 146 states have internal predecessors, (201), 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-14 06:22:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 201 transitions. [2024-10-14 06:22:05,468 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 201 transitions. Word has length 36 [2024-10-14 06:22:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:05,469 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 201 transitions. [2024-10-14 06:22:05,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 4 states have internal predecessors, (36), 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-14 06:22:05,469 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 201 transitions. [2024-10-14 06:22:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 06:22:05,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:05,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:05,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 06:22:05,470 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:05,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:05,470 INFO L85 PathProgramCache]: Analyzing trace with hash -475081967, now seen corresponding path program 1 times [2024-10-14 06:22:05,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:05,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572317140] [2024-10-14 06:22:05,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:05,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:05,594 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-14 06:22:05,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 06:22:05,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572317140] [2024-10-14 06:22:05,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572317140] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:05,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:05,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 06:22:05,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250373303] [2024-10-14 06:22:05,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:05,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 06:22:05,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 06:22:05,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 06:22:05,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 06:22:05,597 INFO L87 Difference]: Start difference. First operand 147 states and 201 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-14 06:22:05,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:05,649 INFO L93 Difference]: Finished difference Result 322 states and 444 transitions. [2024-10-14 06:22:05,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 06:22:05,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2024-10-14 06:22:05,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:05,651 INFO L225 Difference]: With dead ends: 322 [2024-10-14 06:22:05,651 INFO L226 Difference]: Without dead ends: 198 [2024-10-14 06:22:05,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 06:22:05,653 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 240 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:05,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 307 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 06:22:05,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-10-14 06:22:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 155. [2024-10-14 06:22:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.3636363636363635) internal successors, (210), 154 states have internal predecessors, (210), 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-14 06:22:05,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 210 transitions. [2024-10-14 06:22:05,658 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 210 transitions. Word has length 37 [2024-10-14 06:22:05,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:05,658 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 210 transitions. [2024-10-14 06:22:05,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 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-14 06:22:05,658 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 210 transitions. [2024-10-14 06:22:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-10-14 06:22:05,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:05,659 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:05,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 06:22:05,659 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:05,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:05,660 INFO L85 PathProgramCache]: Analyzing trace with hash -680388360, now seen corresponding path program 1 times [2024-10-14 06:22:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 06:22:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866111153] [2024-10-14 06:22:05,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 06:22:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:22:05,688 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 06:22:05,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 06:22:05,747 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 06:22:05,747 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 06:22:05,749 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 06:22:05,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 06:22:05,754 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 06:22:05,819 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 06:22:05,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:22:05 BoogieIcfgContainer [2024-10-14 06:22:05,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 06:22:05,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 06:22:05,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 06:22:05,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 06:22:05,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:21:57" (3/4) ... [2024-10-14 06:22:05,828 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 06:22:05,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 06:22:05,830 INFO L158 Benchmark]: Toolchain (without parser) took 9894.37ms. Allocated memory was 157.3MB in the beginning and 268.4MB in the end (delta: 111.1MB). Free memory was 90.2MB in the beginning and 87.6MB in the end (delta: 2.7MB). Peak memory consumption was 115.6MB. Max. memory is 16.1GB. [2024-10-14 06:22:05,830 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 157.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:22:05,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.93ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 126.7MB in the end (delta: -36.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. [2024-10-14 06:22:05,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 128.81ms. Allocated memory is still 157.3MB. Free memory was 126.7MB in the beginning and 119.6MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:22:05,831 INFO L158 Benchmark]: Boogie Preprocessor took 124.74ms. Allocated memory is still 157.3MB. Free memory was 119.6MB in the beginning and 114.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 06:22:05,832 INFO L158 Benchmark]: RCFGBuilder took 931.76ms. Allocated memory is still 157.3MB. Free memory was 114.1MB in the beginning and 68.7MB in the end (delta: 45.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2024-10-14 06:22:05,832 INFO L158 Benchmark]: TraceAbstraction took 8275.74ms. Allocated memory was 157.3MB in the beginning and 268.4MB in the end (delta: 111.1MB). Free memory was 68.0MB in the beginning and 87.6MB in the end (delta: -19.6MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. [2024-10-14 06:22:05,832 INFO L158 Benchmark]: Witness Printer took 4.54ms. Allocated memory is still 268.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 06:22:05,834 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.34ms. Allocated memory is still 157.3MB. Free memory is still 121.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.93ms. Allocated memory is still 157.3MB. Free memory was 90.0MB in the beginning and 126.7MB in the end (delta: -36.7MB). Peak memory consumption was 18.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 128.81ms. Allocated memory is still 157.3MB. Free memory was 126.7MB in the beginning and 119.6MB in the end (delta: 7.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 124.74ms. Allocated memory is still 157.3MB. Free memory was 119.6MB in the beginning and 114.1MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 931.76ms. Allocated memory is still 157.3MB. Free memory was 114.1MB in the beginning and 68.7MB in the end (delta: 45.4MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. * TraceAbstraction took 8275.74ms. Allocated memory was 157.3MB in the beginning and 268.4MB in the end (delta: 111.1MB). Free memory was 68.0MB in the beginning and 87.6MB in the end (delta: -19.6MB). Peak memory consumption was 93.4MB. Max. memory is 16.1GB. * Witness Printer took 4.54ms. Allocated memory is still 268.4MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 113. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 8); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (8 - 1); [L32] const SORT_8 mask_SORT_8 = (SORT_8)-1 >> (sizeof(SORT_8) * 8 - 32); [L33] const SORT_8 msb_SORT_8 = (SORT_8)1 << (32 - 1); [L35] const SORT_52 mask_SORT_52 = (SORT_52)-1 >> (sizeof(SORT_52) * 8 - 2); [L36] const SORT_52 msb_SORT_52 = (SORT_52)1 << (2 - 1); [L38] const SORT_54 mask_SORT_54 = (SORT_54)-1 >> (sizeof(SORT_54) * 8 - 3); [L39] const SORT_54 msb_SORT_54 = (SORT_54)1 << (3 - 1); [L41] const SORT_4 var_5 = 0; [L42] const SORT_8 var_10 = 0; [L43] const SORT_8 var_13 = 1; [L44] const SORT_8 var_17 = 2; [L45] const SORT_8 var_21 = 3; [L46] const SORT_8 var_25 = 4; [L47] const SORT_1 var_30 = 1; [L48] const SORT_4 var_41 = 1; [L49] const SORT_4 var_44 = 4; [L50] const SORT_4 var_45 = 3; [L51] const SORT_4 var_50 = 2; [L53] SORT_1 input_2; [L54] SORT_1 input_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L56] SORT_4 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L58] SORT_4 init_7_arg_1 = var_5; [L59] state_6 = init_7_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L62] input_2 = __VERIFIER_nondet_uchar() [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L64] input_3 = input_3 & mask_SORT_1 [L67] SORT_4 var_9_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0, var_9_arg_0=0] [L68] EXPR var_9_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L68] var_9_arg_0 = var_9_arg_0 & mask_SORT_4 [L69] SORT_8 var_9 = var_9_arg_0; [L70] SORT_8 var_11_arg_0 = var_9; [L71] SORT_8 var_11_arg_1 = var_10; [L72] SORT_1 var_11 = var_11_arg_0 == var_11_arg_1; [L73] SORT_4 var_12_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_12_arg_0=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] EXPR var_12_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_11=1, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L74] var_12_arg_0 = var_12_arg_0 & mask_SORT_4 [L75] SORT_8 var_12 = var_12_arg_0; [L76] SORT_8 var_14_arg_0 = var_12; [L77] SORT_8 var_14_arg_1 = var_13; [L78] SORT_1 var_14 = var_14_arg_0 == var_14_arg_1; [L79] SORT_1 var_15_arg_0 = var_11; [L80] SORT_1 var_15_arg_1 = var_14; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15_arg_0=1, var_15_arg_1=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] EXPR var_15_arg_0 | var_15_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L81] SORT_1 var_15 = var_15_arg_0 | var_15_arg_1; [L82] SORT_4 var_16_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_16_arg_0=0, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] EXPR var_16_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_15=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L83] var_16_arg_0 = var_16_arg_0 & mask_SORT_4 [L84] SORT_8 var_16 = var_16_arg_0; [L85] SORT_8 var_18_arg_0 = var_16; [L86] SORT_8 var_18_arg_1 = var_17; [L87] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19_arg_1 = var_18; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19_arg_0=1, var_19_arg_1=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] EXPR var_19_arg_0 | var_19_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L90] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L91] SORT_4 var_20_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_20_arg_0=0, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] EXPR var_20_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_19=1, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L92] var_20_arg_0 = var_20_arg_0 & mask_SORT_4 [L93] SORT_8 var_20 = var_20_arg_0; [L94] SORT_8 var_22_arg_0 = var_20; [L95] SORT_8 var_22_arg_1 = var_21; [L96] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L97] SORT_1 var_23_arg_0 = var_19; [L98] SORT_1 var_23_arg_1 = var_22; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23_arg_0=1, var_23_arg_1=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] EXPR var_23_arg_0 | var_23_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L99] SORT_1 var_23 = var_23_arg_0 | var_23_arg_1; [L100] SORT_4 var_24_arg_0 = state_6; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_24_arg_0=0, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] EXPR var_24_arg_0 & mask_SORT_4 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_23=1, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L101] var_24_arg_0 = var_24_arg_0 & mask_SORT_4 [L102] SORT_8 var_24 = var_24_arg_0; [L103] SORT_8 var_26_arg_0 = var_24; [L104] SORT_8 var_26_arg_1 = var_25; [L105] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L106] SORT_1 var_27_arg_0 = var_23; [L107] SORT_1 var_27_arg_1 = var_26; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_27_arg_0=1, var_27_arg_1=0, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] EXPR var_27_arg_0 | var_27_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L108] SORT_1 var_27 = var_27_arg_0 | var_27_arg_1; [L109] SORT_1 var_31_arg_0 = var_27; [L110] SORT_1 var_31 = ~var_31_arg_0; [L111] SORT_1 var_32_arg_0 = var_30; [L112] SORT_1 var_32_arg_1 = var_31; VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_32_arg_0=1, var_32_arg_1=-2, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] EXPR var_32_arg_0 & var_32_arg_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L113] SORT_1 var_32 = var_32_arg_0 & var_32_arg_1; [L114] EXPR var_32 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_4=255, mask_SORT_52=3, mask_SORT_54=7, state_6=0, var_10=0, var_13=1, var_17=2, var_21=3, var_25=4, var_30=1, var_41=1, var_44=4, var_45=3, var_50=2, var_5=0] [L114] var_32 = var_32 & mask_SORT_1 [L115] SORT_1 bad_33_arg_0 = var_32; [L116] CALL __VERIFIER_assert(!(bad_33_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 79 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.1s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2079 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2079 mSDsluCounter, 7355 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5913 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1231 IncrementalHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 1442 mSDtfsCounter, 1231 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=11, InterpolantAutomatonStates: 103, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 330 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 517 NumberOfCodeBlocks, 517 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 466 ConstructedInterpolants, 0 QuantifiedInterpolants, 1570 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 06:22:05,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.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 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 06:22:08,364 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 06:22:08,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 06:22:08,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 06:22:08,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 06:22:08,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 06:22:08,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 06:22:08,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 06:22:08,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 06:22:08,490 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 06:22:08,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 06:22:08,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 06:22:08,494 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 06:22:08,498 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 06:22:08,498 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 06:22:08,499 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 06:22:08,499 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 06:22:08,500 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 06:22:08,500 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 06:22:08,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 06:22:08,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 06:22:08,501 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 06:22:08,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 06:22:08,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 06:22:08,502 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 06:22:08,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 06:22:08,502 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 06:22:08,503 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 06:22:08,503 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 06:22:08,503 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 06:22:08,503 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 06:22:08,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:22:08,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 06:22:08,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 06:22:08,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 06:22:08,504 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 06:22:08,505 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 06:22:08,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 06:22:08,506 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 06:22:08,507 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 06:22:08,507 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 06:22:08,508 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 06:22:08,508 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 -> 827228a8fb731d7038bb1b8c7cce3c35edda9a5c3ee552084966688fbdc104d2 [2024-10-14 06:22:08,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 06:22:08,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 06:22:08,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 06:22:08,918 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 06:22:08,919 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 06:22:08,920 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-10-14 06:22:10,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 06:22:10,776 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 06:22:10,778 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_segments.c [2024-10-14 06:22:10,789 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cec8fcd5/5a2e2df3e0394f3db07afdfef2f5f77d/FLAGb805387be [2024-10-14 06:22:10,803 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cec8fcd5/5a2e2df3e0394f3db07afdfef2f5f77d [2024-10-14 06:22:10,805 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 06:22:10,806 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 06:22:10,807 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 06:22:10,807 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 06:22:10,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 06:22:10,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:22:10" (1/1) ... [2024-10-14 06:22:10,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126db419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:10, skipping insertion in model container [2024-10-14 06:22:10,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:22:10" (1/1) ... [2024-10-14 06:22:10,846 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 06:22:11,030 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.h_segments.c[1250,1263] [2024-10-14 06:22:11,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:22:11,134 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 06:22:11,147 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.h_segments.c[1250,1263] [2024-10-14 06:22:11,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 06:22:11,243 INFO L204 MainTranslator]: Completed translation [2024-10-14 06:22:11,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11 WrapperNode [2024-10-14 06:22:11,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 06:22:11,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 06:22:11,247 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 06:22:11,247 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 06:22:11,255 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,267 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,301 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 164 [2024-10-14 06:22:11,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 06:22:11,305 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 06:22:11,306 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 06:22:11,306 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 06:22:11,317 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,326 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,350 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-14 06:22:11,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,351 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,357 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,362 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 06:22:11,367 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 06:22:11,368 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 06:22:11,368 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 06:22:11,369 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (1/1) ... [2024-10-14 06:22:11,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 06:22:11,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 06:22:11,412 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-14 06:22:11,415 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-14 06:22:11,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 06:22:11,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 06:22:11,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 06:22:11,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 06:22:11,610 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 06:22:11,612 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 06:22:11,968 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-10-14 06:22:11,968 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 06:22:12,019 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 06:22:12,019 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 06:22:12,020 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:22:12 BoogieIcfgContainer [2024-10-14 06:22:12,020 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 06:22:12,024 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 06:22:12,025 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 06:22:12,028 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 06:22:12,029 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:22:10" (1/3) ... [2024-10-14 06:22:12,030 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ecf6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:22:12, skipping insertion in model container [2024-10-14 06:22:12,030 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:22:11" (2/3) ... [2024-10-14 06:22:12,031 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69ecf6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:22:12, skipping insertion in model container [2024-10-14 06:22:12,032 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:22:12" (3/3) ... [2024-10-14 06:22:12,033 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_segments.c [2024-10-14 06:22:12,055 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 06:22:12,055 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 06:22:12,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 06:22:12,123 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;@180d7f6b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 06:22:12,123 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 06:22:12,127 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-14 06:22:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 06:22:12,133 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:12,133 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 06:22:12,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:12,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 06:22:12,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:22:12,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [403080836] [2024-10-14 06:22:12,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:12,151 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-14 06:22:12,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:22:12,155 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-14 06:22:12,157 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-14 06:22:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:12,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-14 06:22:12,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:22:12,596 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-14 06:22:12,598 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 06:22:12,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:22:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [403080836] [2024-10-14 06:22:12,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [403080836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 06:22:12,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 06:22:12,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 06:22:12,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476355051] [2024-10-14 06:22:12,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 06:22:12,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 06:22:12,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:22:12,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 06:22:12,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 06:22:12,639 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-14 06:22:12,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:12,703 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 06:22:12,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 06:22:12,706 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-14 06:22:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:12,714 INFO L225 Difference]: With dead ends: 15 [2024-10-14 06:22:12,714 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 06:22:12,718 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-14 06:22:12,722 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-14 06:22:12,723 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-14 06:22:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 06:22:12,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 06:22:12,754 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-14 06:22:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 06:22:12,756 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 06:22:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:12,757 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 06:22:12,757 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-14 06:22:12,757 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 06:22:12,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 06:22:12,758 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:12,758 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 06:22:12,763 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-14 06:22:12,961 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-14 06:22:12,962 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:12,963 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 06:22:12,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:22:12,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321091894] [2024-10-14 06:22:12,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 06:22:12,964 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-14 06:22:12,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:22:12,968 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-14 06:22:12,969 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-14 06:22:13,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 06:22:13,130 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-10-14 06:22:13,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:22:13,887 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-14 06:22:13,888 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 06:22:57,354 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-14 06:22:57,355 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 06:22:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321091894] [2024-10-14 06:22:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321091894] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 06:22:57,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 06:22:57,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 06:22:57,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515549419] [2024-10-14 06:22:57,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 06:22:57,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 06:22:57,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 06:22:57,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 06:22:57,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-14 06:22:57,359 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-14 06:22:57,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 06:22:57,520 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-10-14 06:22:57,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 06:22:57,521 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-14 06:22:57,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 06:22:57,522 INFO L225 Difference]: With dead ends: 14 [2024-10-14 06:22:57,522 INFO L226 Difference]: Without dead ends: 12 [2024-10-14 06:22:57,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 06:22:57,523 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 4 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 06:22:57,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 06:22:57,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-10-14 06:22:57,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 11. [2024-10-14 06:22:57,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 06:22:57,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 06:22:57,528 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 06:22:57,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 06:22:57,528 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 06:22:57,528 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-14 06:22:57,529 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 06:22:57,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 06:22:57,529 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 06:22:57,529 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 06:22:57,536 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-14 06:22:57,730 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-14 06:22:57,731 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 06:22:57,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 06:22:57,732 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 06:22:57,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 06:22:57,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1000597459] [2024-10-14 06:22:57,733 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 06:22:57,733 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-14 06:22:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 06:22:57,737 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-14 06:22:57,738 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-14 06:22:57,905 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 06:22:57,906 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 06:22:57,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-10-14 06:22:57,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 06:22:59,597 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 06:22:59,598 INFO L311 TraceCheckSpWp]: Computing backward predicates...