./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label59.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label59.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 32bit --witnessprinter.graph.data.programhash 86b33a3328c808cec34f54492a07e8640c009630cc5a59a5959b66da0514436c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:34:56,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:34:57,056 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:34:57,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:34:57,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:34:57,085 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:34:57,086 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:34:57,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:34:57,087 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:34:57,087 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:34:57,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:34:57,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:34:57,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:34:57,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:34:57,089 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:34:57,089 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:34:57,089 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:34:57,089 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:34:57,090 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:34:57,090 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:34:57,090 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:34:57,091 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:34:57,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:34:57,091 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:34:57,092 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:34:57,092 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:34:57,092 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:34:57,092 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:34:57,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:34:57,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:34:57,093 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:34:57,093 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:34:57,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:34:57,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:34:57,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:34:57,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:34:57,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:34:57,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:34:57,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:34:57,095 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:34:57,095 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:34:57,101 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:34:57,101 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-clean/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-clean/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 86b33a3328c808cec34f54492a07e8640c009630cc5a59a5959b66da0514436c [2024-10-10 23:34:57,276 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:34:57,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:34:57,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:34:57,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:34:57,296 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:34:57,297 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label59.c [2024-10-10 23:34:58,634 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:34:58,842 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:34:58,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label59.c [2024-10-10 23:34:58,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/623ce0160/137a5f94835546baae54f54c76eaee01/FLAG27fa5b7c9 [2024-10-10 23:34:58,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/623ce0160/137a5f94835546baae54f54c76eaee01 [2024-10-10 23:34:58,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:34:58,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:34:58,884 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:34:58,884 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:34:58,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:34:58,890 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:34:58" (1/1) ... [2024-10-10 23:34:58,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e721f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:58, skipping insertion in model container [2024-10-10 23:34:58,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:34:58" (1/1) ... [2024-10-10 23:34:58,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:34:59,193 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/eca-rers2012/Problem14_label59.c[4234,4247] [2024-10-10 23:34:59,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:34:59,410 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:34:59,450 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/eca-rers2012/Problem14_label59.c[4234,4247] [2024-10-10 23:34:59,558 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:34:59,572 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:34:59,572 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59 WrapperNode [2024-10-10 23:34:59,572 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:34:59,573 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:34:59,573 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:34:59,574 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:34:59,579 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,598 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,651 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:34:59,652 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:34:59,652 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:34:59,652 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:34:59,653 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:34:59,661 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,662 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,666 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,698 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-10 23:34:59,701 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,717 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,723 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,728 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,732 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,740 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:34:59,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:34:59,741 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:34:59,741 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:34:59,741 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (1/1) ... [2024-10-10 23:34:59,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:34:59,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:59,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:34:59,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:34:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:34:59,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:34:59,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:34:59,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:34:59,870 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:34:59,871 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:35:00,718 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:35:00,718 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:35:00,759 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:35:00,760 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:35:00,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:00 BoogieIcfgContainer [2024-10-10 23:35:00,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:35:00,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:35:00,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:35:00,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:35:00,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:34:58" (1/3) ... [2024-10-10 23:35:00,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c2de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:35:00, skipping insertion in model container [2024-10-10 23:35:00,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:59" (2/3) ... [2024-10-10 23:35:00,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74c2de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:35:00, skipping insertion in model container [2024-10-10 23:35:00,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:00" (3/3) ... [2024-10-10 23:35:00,769 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label59.c [2024-10-10 23:35:00,781 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:35:00,782 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:35:00,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:35:00,843 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;@6a034105, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:35:00,844 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:35:00,847 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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-10 23:35:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 23:35:00,854 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:00,855 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, 1, 1] [2024-10-10 23:35:00,856 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:00,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:00,861 INFO L85 PathProgramCache]: Analyzing trace with hash 398588045, now seen corresponding path program 1 times [2024-10-10 23:35:00,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:00,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333166416] [2024-10-10 23:35:00,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:00,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:01,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:01,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:01,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333166416] [2024-10-10 23:35:01,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333166416] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:01,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:01,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:01,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730387607] [2024-10-10 23:35:01,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:01,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:35:01,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:01,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:35:01,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:35:01,058 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 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 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:01,098 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:35:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:35:01,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-10 23:35:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:01,108 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:35:01,108 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:35:01,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:35:01,113 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:01,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:35:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:35:01,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:35:01,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 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-10 23:35:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:35:01,160 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 39 [2024-10-10 23:35:01,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:01,160 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:35:01,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:01,161 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:35:01,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-10-10 23:35:01,161 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:01,162 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, 1, 1] [2024-10-10 23:35:01,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:35:01,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:01,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:01,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1694516953, now seen corresponding path program 1 times [2024-10-10 23:35:01,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460647705] [2024-10-10 23:35:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:01,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:01,390 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-10 23:35:01,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:01,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460647705] [2024-10-10 23:35:01,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460647705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:01,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:01,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:01,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193334986] [2024-10-10 23:35:01,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:01,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:01,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:01,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:01,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:01,392 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:02,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:02,082 INFO L93 Difference]: Finished difference Result 361 states and 589 transitions. [2024-10-10 23:35:02,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:02,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2024-10-10 23:35:02,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:02,085 INFO L225 Difference]: With dead ends: 361 [2024-10-10 23:35:02,085 INFO L226 Difference]: Without dead ends: 359 [2024-10-10 23:35:02,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:02,086 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 145 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:02,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 10 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:35:02,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-10 23:35:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-10 23:35:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.6396648044692737) internal successors, (587), 358 states have internal predecessors, (587), 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-10 23:35:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 587 transitions. [2024-10-10 23:35:02,105 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 587 transitions. Word has length 39 [2024-10-10 23:35:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:02,106 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 587 transitions. [2024-10-10 23:35:02,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 2 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 587 transitions. [2024-10-10 23:35:02,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-10 23:35:02,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:02,108 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:35:02,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:35:02,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:02,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1541871853, now seen corresponding path program 1 times [2024-10-10 23:35:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248130276] [2024-10-10 23:35:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:02,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:02,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248130276] [2024-10-10 23:35:02,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248130276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:02,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:02,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:02,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202294902] [2024-10-10 23:35:02,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:02,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:02,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:02,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:02,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:02,228 INFO L87 Difference]: Start difference. First operand 359 states and 587 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-10 23:35:02,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:02,804 INFO L93 Difference]: Finished difference Result 1075 states and 1759 transitions. [2024-10-10 23:35:02,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:02,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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 104 [2024-10-10 23:35:02,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:02,807 INFO L225 Difference]: With dead ends: 1075 [2024-10-10 23:35:02,807 INFO L226 Difference]: Without dead ends: 717 [2024-10-10 23:35:02,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:02,809 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 134 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:02,810 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 86 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:35:02,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-10 23:35:02,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 715. [2024-10-10 23:35:02,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.42296918767507) internal successors, (1016), 714 states have internal predecessors, (1016), 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-10 23:35:02,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1016 transitions. [2024-10-10 23:35:02,831 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1016 transitions. Word has length 104 [2024-10-10 23:35:02,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:02,832 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1016 transitions. [2024-10-10 23:35:02,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 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-10 23:35:02,832 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1016 transitions. [2024-10-10 23:35:02,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-10 23:35:02,834 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:02,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:35:02,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:35:02,835 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:02,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:02,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1830706698, now seen corresponding path program 1 times [2024-10-10 23:35:02,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:02,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706896613] [2024-10-10 23:35:02,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:02,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:02,925 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:02,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:02,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706896613] [2024-10-10 23:35:02,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706896613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:02,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:02,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:35:02,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633084056] [2024-10-10 23:35:02,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:02,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:02,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:02,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:02,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:02,928 INFO L87 Difference]: Start difference. First operand 715 states and 1016 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10 23:35:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:03,465 INFO L93 Difference]: Finished difference Result 1785 states and 2616 transitions. [2024-10-10 23:35:03,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:03,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-10-10 23:35:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:03,469 INFO L225 Difference]: With dead ends: 1785 [2024-10-10 23:35:03,469 INFO L226 Difference]: Without dead ends: 1071 [2024-10-10 23:35:03,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:03,471 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:03,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 55 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-10 23:35:03,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-10 23:35:03,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.3841121495327102) internal successors, (1481), 1070 states have internal predecessors, (1481), 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-10 23:35:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1481 transitions. [2024-10-10 23:35:03,493 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1481 transitions. Word has length 105 [2024-10-10 23:35:03,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:03,494 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1481 transitions. [2024-10-10 23:35:03,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-10 23:35:03,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1481 transitions. [2024-10-10 23:35:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-10 23:35:03,496 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:03,497 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:35:03,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:35:03,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:03,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:03,498 INFO L85 PathProgramCache]: Analyzing trace with hash 736025737, now seen corresponding path program 1 times [2024-10-10 23:35:03,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:03,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082940969] [2024-10-10 23:35:03,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:03,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:03,767 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:03,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:03,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082940969] [2024-10-10 23:35:03,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082940969] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:03,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:03,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:03,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094013937] [2024-10-10 23:35:03,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:03,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:03,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:03,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:03,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:03,773 INFO L87 Difference]: Start difference. First operand 1071 states and 1481 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:04,484 INFO L93 Difference]: Finished difference Result 2497 states and 3365 transitions. [2024-10-10 23:35:04,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:04,484 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2024-10-10 23:35:04,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:04,488 INFO L225 Difference]: With dead ends: 2497 [2024-10-10 23:35:04,488 INFO L226 Difference]: Without dead ends: 1427 [2024-10-10 23:35:04,489 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-10 23:35:04,490 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 438 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:04,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 119 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:35:04,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-10-10 23:35:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1249. [2024-10-10 23:35:04,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 1.3389423076923077) internal successors, (1671), 1248 states have internal predecessors, (1671), 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-10 23:35:04,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1671 transitions. [2024-10-10 23:35:04,505 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1671 transitions. Word has length 108 [2024-10-10 23:35:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:04,506 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1671 transitions. [2024-10-10 23:35:04,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:04,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1671 transitions. [2024-10-10 23:35:04,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-10 23:35:04,507 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:04,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:04,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:35:04,508 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:04,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:04,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1779971725, now seen corresponding path program 1 times [2024-10-10 23:35:04,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:04,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276942156] [2024-10-10 23:35:04,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:04,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:04,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:04,682 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:04,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:04,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276942156] [2024-10-10 23:35:04,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276942156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:04,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2912609] [2024-10-10 23:35:04,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:04,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:04,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:04,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:04,686 INFO L87 Difference]: Start difference. First operand 1249 states and 1671 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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-10 23:35:05,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:05,222 INFO L93 Difference]: Finished difference Result 2884 states and 3776 transitions. [2024-10-10 23:35:05,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:05,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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 119 [2024-10-10 23:35:05,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:05,227 INFO L225 Difference]: With dead ends: 2884 [2024-10-10 23:35:05,227 INFO L226 Difference]: Without dead ends: 1607 [2024-10-10 23:35:05,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:05,229 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 103 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:05,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 120 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-10-10 23:35:05,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2024-10-10 23:35:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1604 states have (on average 1.1770573566084788) internal successors, (1888), 1604 states have internal predecessors, (1888), 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-10 23:35:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 1888 transitions. [2024-10-10 23:35:05,249 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 1888 transitions. Word has length 119 [2024-10-10 23:35:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:05,250 INFO L471 AbstractCegarLoop]: Abstraction has 1605 states and 1888 transitions. [2024-10-10 23:35:05,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 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-10 23:35:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 1888 transitions. [2024-10-10 23:35:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-10 23:35:05,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:05,251 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2024-10-10 23:35:05,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:35:05,252 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:05,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:05,256 INFO L85 PathProgramCache]: Analyzing trace with hash 462740737, now seen corresponding path program 1 times [2024-10-10 23:35:05,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:05,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052909188] [2024-10-10 23:35:05,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:05,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:05,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:05,419 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:35:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:05,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052909188] [2024-10-10 23:35:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052909188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:05,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:05,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175067688] [2024-10-10 23:35:05,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:05,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:05,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:05,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:05,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:05,423 INFO L87 Difference]: Start difference. First operand 1605 states and 1888 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-10 23:35:05,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:05,854 INFO L93 Difference]: Finished difference Result 3743 states and 4423 transitions. [2024-10-10 23:35:05,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:05,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 213 [2024-10-10 23:35:05,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:05,860 INFO L225 Difference]: With dead ends: 3743 [2024-10-10 23:35:05,860 INFO L226 Difference]: Without dead ends: 2139 [2024-10-10 23:35:05,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:05,865 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:05,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 75 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-10 23:35:05,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-10 23:35:05,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.1515434985968194) internal successors, (2462), 2138 states have internal predecessors, (2462), 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-10 23:35:05,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2462 transitions. [2024-10-10 23:35:05,889 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2462 transitions. Word has length 213 [2024-10-10 23:35:05,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:05,890 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2462 transitions. [2024-10-10 23:35:05,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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-10 23:35:05,890 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2462 transitions. [2024-10-10 23:35:05,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-10-10 23:35:05,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:05,893 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:05,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:35:05,894 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:05,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:05,895 INFO L85 PathProgramCache]: Analyzing trace with hash -868592528, now seen corresponding path program 1 times [2024-10-10 23:35:05,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:05,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54318916] [2024-10-10 23:35:05,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:05,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:06,158 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-10 23:35:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:06,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54318916] [2024-10-10 23:35:06,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54318916] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:06,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:06,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:06,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075873611] [2024-10-10 23:35:06,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:06,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:06,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:06,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:06,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:06,162 INFO L87 Difference]: Start difference. First operand 2139 states and 2462 transitions. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 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-10 23:35:06,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:06,680 INFO L93 Difference]: Finished difference Result 4335 states and 5005 transitions. [2024-10-10 23:35:06,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:06,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 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) Word has length 330 [2024-10-10 23:35:06,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:06,686 INFO L225 Difference]: With dead ends: 4335 [2024-10-10 23:35:06,686 INFO L226 Difference]: Without dead ends: 2317 [2024-10-10 23:35:06,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:06,688 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:06,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 14 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:06,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-10 23:35:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2139. [2024-10-10 23:35:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.1033676333021516) internal successors, (2359), 2138 states have internal predecessors, (2359), 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-10 23:35:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2359 transitions. [2024-10-10 23:35:06,724 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2359 transitions. Word has length 330 [2024-10-10 23:35:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:06,725 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2359 transitions. [2024-10-10 23:35:06,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 3 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-10 23:35:06,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2359 transitions. [2024-10-10 23:35:06,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2024-10-10 23:35:06,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:06,730 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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, 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-10 23:35:06,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:35:06,730 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:06,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:06,731 INFO L85 PathProgramCache]: Analyzing trace with hash -856315726, now seen corresponding path program 1 times [2024-10-10 23:35:06,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:06,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143282731] [2024-10-10 23:35:06,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:06,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:35:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143282731] [2024-10-10 23:35:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143282731] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:07,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:07,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111491563] [2024-10-10 23:35:07,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:07,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:07,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:07,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:07,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:07,073 INFO L87 Difference]: Start difference. First operand 2139 states and 2359 transitions. Second operand has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10 23:35:07,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:07,443 INFO L93 Difference]: Finished difference Result 4455 states and 4943 transitions. [2024-10-10 23:35:07,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:07,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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 419 [2024-10-10 23:35:07,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:07,450 INFO L225 Difference]: With dead ends: 4455 [2024-10-10 23:35:07,450 INFO L226 Difference]: Without dead ends: 2495 [2024-10-10 23:35:07,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:07,453 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:07,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 244 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:07,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2495 states. [2024-10-10 23:35:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2495 to 2317. [2024-10-10 23:35:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.1023316062176165) internal successors, (2553), 2316 states have internal predecessors, (2553), 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-10 23:35:07,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2553 transitions. [2024-10-10 23:35:07,480 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2553 transitions. Word has length 419 [2024-10-10 23:35:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:07,481 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2553 transitions. [2024-10-10 23:35:07,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.33333333333333) internal successors, (211), 3 states have internal predecessors, (211), 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-10 23:35:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2553 transitions. [2024-10-10 23:35:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-10-10 23:35:07,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:07,486 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:35:07,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:35:07,486 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:07,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:07,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1367480095, now seen corresponding path program 1 times [2024-10-10 23:35:07,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:07,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70652734] [2024-10-10 23:35:07,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:35:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70652734] [2024-10-10 23:35:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70652734] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:07,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272861111] [2024-10-10 23:35:07,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:07,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:07,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:07,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:07,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:07,807 INFO L87 Difference]: Start difference. First operand 2317 states and 2553 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-10 23:35:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:08,291 INFO L93 Difference]: Finished difference Result 4989 states and 5543 transitions. [2024-10-10 23:35:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 425 [2024-10-10 23:35:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:08,308 INFO L225 Difference]: With dead ends: 4989 [2024-10-10 23:35:08,309 INFO L226 Difference]: Without dead ends: 2851 [2024-10-10 23:35:08,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:08,316 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:08,317 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-10 23:35:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2317. [2024-10-10 23:35:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.0971502590673574) internal successors, (2541), 2316 states have internal predecessors, (2541), 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-10 23:35:08,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 2541 transitions. [2024-10-10 23:35:08,379 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 2541 transitions. Word has length 425 [2024-10-10 23:35:08,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:08,383 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 2541 transitions. [2024-10-10 23:35:08,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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-10 23:35:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 2541 transitions. [2024-10-10 23:35:08,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-10 23:35:08,391 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:08,391 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:08,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:35:08,392 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:08,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash -206064942, now seen corresponding path program 1 times [2024-10-10 23:35:08,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:08,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705787967] [2024-10-10 23:35:08,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:08,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 671 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:35:08,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:08,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705787967] [2024-10-10 23:35:08,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705787967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:08,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:08,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:08,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4493650] [2024-10-10 23:35:08,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:08,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:08,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:08,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:08,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:08,858 INFO L87 Difference]: Start difference. First operand 2317 states and 2541 transitions. Second operand has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-10 23:35:09,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:09,327 INFO L93 Difference]: Finished difference Result 5167 states and 5724 transitions. [2024-10-10 23:35:09,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:09,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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 432 [2024-10-10 23:35:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:09,337 INFO L225 Difference]: With dead ends: 5167 [2024-10-10 23:35:09,337 INFO L226 Difference]: Without dead ends: 3029 [2024-10-10 23:35:09,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:09,341 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 112 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:09,341 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 200 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:09,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2024-10-10 23:35:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2673. [2024-10-10 23:35:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2673 states, 2672 states have (on average 1.0800898203592815) internal successors, (2886), 2672 states have internal predecessors, (2886), 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-10 23:35:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2673 states to 2673 states and 2886 transitions. [2024-10-10 23:35:09,372 INFO L78 Accepts]: Start accepts. Automaton has 2673 states and 2886 transitions. Word has length 432 [2024-10-10 23:35:09,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:09,372 INFO L471 AbstractCegarLoop]: Abstraction has 2673 states and 2886 transitions. [2024-10-10 23:35:09,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.66666666666667) internal successors, (224), 3 states have internal predecessors, (224), 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-10 23:35:09,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2673 states and 2886 transitions. [2024-10-10 23:35:09,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-10 23:35:09,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:09,377 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:09,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:35:09,377 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:09,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash 2074638239, now seen corresponding path program 1 times [2024-10-10 23:35:09,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060937693] [2024-10-10 23:35:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:09,582 INFO L134 CoverageAnalysis]: Checked inductivity of 785 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:35:09,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:09,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060937693] [2024-10-10 23:35:09,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060937693] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:09,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:09,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:09,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952689757] [2024-10-10 23:35:09,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:09,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:09,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:09,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:09,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:09,585 INFO L87 Difference]: Start difference. First operand 2673 states and 2886 transitions. Second operand has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-10 23:35:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:10,016 INFO L93 Difference]: Finished difference Result 6235 states and 6825 transitions. [2024-10-10 23:35:10,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:10,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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 473 [2024-10-10 23:35:10,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:10,025 INFO L225 Difference]: With dead ends: 6235 [2024-10-10 23:35:10,025 INFO L226 Difference]: Without dead ends: 3741 [2024-10-10 23:35:10,028 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:10,029 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 73 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:10,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 48 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:10,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2024-10-10 23:35:10,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3741. [2024-10-10 23:35:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3741 states, 3740 states have (on average 1.0772727272727274) internal successors, (4029), 3740 states have internal predecessors, (4029), 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-10 23:35:10,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3741 states to 3741 states and 4029 transitions. [2024-10-10 23:35:10,082 INFO L78 Accepts]: Start accepts. Automaton has 3741 states and 4029 transitions. Word has length 473 [2024-10-10 23:35:10,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:10,083 INFO L471 AbstractCegarLoop]: Abstraction has 3741 states and 4029 transitions. [2024-10-10 23:35:10,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.33333333333333) internal successors, (265), 3 states have internal predecessors, (265), 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-10 23:35:10,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3741 states and 4029 transitions. [2024-10-10 23:35:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2024-10-10 23:35:10,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:10,086 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:10,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:35:10,086 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:10,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -469156014, now seen corresponding path program 1 times [2024-10-10 23:35:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753654383] [2024-10-10 23:35:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1008 backedges. 625 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2024-10-10 23:35:10,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:10,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753654383] [2024-10-10 23:35:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753654383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599771709] [2024-10-10 23:35:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:10,412 INFO L87 Difference]: Start difference. First operand 3741 states and 4029 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-10 23:35:10,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:10,800 INFO L93 Difference]: Finished difference Result 7481 states and 8072 transitions. [2024-10-10 23:35:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:10,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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 509 [2024-10-10 23:35:10,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:10,810 INFO L225 Difference]: With dead ends: 7481 [2024-10-10 23:35:10,810 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:35:10,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:10,814 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:10,814 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 240 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:35:10,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-10 23:35:10,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0741156653565413) internal successors, (3826), 3562 states have internal predecessors, (3826), 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-10 23:35:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3826 transitions. [2024-10-10 23:35:10,853 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3826 transitions. Word has length 509 [2024-10-10 23:35:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:10,853 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3826 transitions. [2024-10-10 23:35:10,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 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-10 23:35:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3826 transitions. [2024-10-10 23:35:10,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2024-10-10 23:35:10,856 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:10,856 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:10,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:35:10,856 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:10,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1866435868, now seen corresponding path program 1 times [2024-10-10 23:35:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:10,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140616801] [2024-10-10 23:35:10,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:10,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:10,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 832 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:35:11,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140616801] [2024-10-10 23:35:11,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140616801] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:11,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187368449] [2024-10-10 23:35:11,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:11,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:11,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:11,231 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:11,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:35:11,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:11,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:35:11,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:11,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1256 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 1067 trivial. 0 not checked. [2024-10-10 23:35:11,505 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:11,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187368449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:11,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:11,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:35:11,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017601883] [2024-10-10 23:35:11,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:11,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:11,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:11,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:11,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:35:11,507 INFO L87 Difference]: Start difference. First operand 3563 states and 3826 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10 23:35:11,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:11,898 INFO L93 Difference]: Finished difference Result 7659 states and 8230 transitions. [2024-10-10 23:35:11,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:11,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 628 [2024-10-10 23:35:11,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:11,906 INFO L225 Difference]: With dead ends: 7659 [2024-10-10 23:35:11,906 INFO L226 Difference]: Without dead ends: 3385 [2024-10-10 23:35:11,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 631 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:35:11,910 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 400 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:11,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 238 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 400 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:11,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-10 23:35:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 2851. [2024-10-10 23:35:11,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.0673684210526315) internal successors, (3042), 2850 states have internal predecessors, (3042), 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-10 23:35:11,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3042 transitions. [2024-10-10 23:35:11,936 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3042 transitions. Word has length 628 [2024-10-10 23:35:11,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:11,937 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3042 transitions. [2024-10-10 23:35:11,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-10 23:35:11,937 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3042 transitions. [2024-10-10 23:35:11,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2024-10-10 23:35:11,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:11,941 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10 23:35:11,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-10 23:35:12,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:35:12,143 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:12,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1471215586, now seen corresponding path program 1 times [2024-10-10 23:35:12,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:12,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256067201] [2024-10-10 23:35:12,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:12,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:12,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:12,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 1319 proven. 155 refuted. 0 times theorem prover too weak. 352 trivial. 0 not checked. [2024-10-10 23:35:12,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256067201] [2024-10-10 23:35:12,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256067201] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:12,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544826511] [2024-10-10 23:35:12,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:12,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:12,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:12,706 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:12,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:35:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:12,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:35:12,883 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:12,981 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 227 proven. 0 refuted. 0 times theorem prover too weak. 1599 trivial. 0 not checked. [2024-10-10 23:35:12,981 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:12,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544826511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:12,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:12,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-10-10 23:35:12,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288050933] [2024-10-10 23:35:12,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:12,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:12,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:12,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:12,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:35:12,986 INFO L87 Difference]: Start difference. First operand 2851 states and 3042 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-10 23:35:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:13,355 INFO L93 Difference]: Finished difference Result 6233 states and 6660 transitions. [2024-10-10 23:35:13,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:13,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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 790 [2024-10-10 23:35:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:13,360 INFO L225 Difference]: With dead ends: 6233 [2024-10-10 23:35:13,360 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:35:13,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 793 GetRequests, 790 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:35:13,365 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 141 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:13,365 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 230 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:35:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:35:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:35:13,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 790 [2024-10-10 23:35:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:13,367 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:35:13,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 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-10 23:35:13,367 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:35:13,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:35:13,370 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:35:13,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:35:13,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:35:13,574 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:13,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:35:13,927 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:35:13,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:35:13 BoogieIcfgContainer [2024-10-10 23:35:13,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:35:13,940 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:35:13,940 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:35:13,940 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:35:13,941 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:35:00" (3/4) ... [2024-10-10 23:35:13,943 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:35:13,956 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:35:13,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:35:13,957 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:35:13,958 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:35:14,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:35:14,084 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:35:14,084 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:35:14,084 INFO L158 Benchmark]: Toolchain (without parser) took 15204.72ms. Allocated memory was 216.0MB in the beginning and 687.9MB in the end (delta: 471.9MB). Free memory was 148.6MB in the beginning and 496.4MB in the end (delta: -347.7MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,085 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 119.5MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:35:14,085 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.09ms. Allocated memory is still 216.0MB. Free memory was 148.4MB in the beginning and 174.6MB in the end (delta: -26.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,085 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.42ms. Allocated memory is still 216.0MB. Free memory was 174.6MB in the beginning and 165.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,085 INFO L158 Benchmark]: Boogie Preprocessor took 87.65ms. Allocated memory is still 216.0MB. Free memory was 165.1MB in the beginning and 152.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,086 INFO L158 Benchmark]: RCFGBuilder took 1020.65ms. Allocated memory is still 216.0MB. Free memory was 151.6MB in the beginning and 115.7MB in the end (delta: 35.9MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,086 INFO L158 Benchmark]: TraceAbstraction took 13176.69ms. Allocated memory was 216.0MB in the beginning and 687.9MB in the end (delta: 471.9MB). Free memory was 114.6MB in the beginning and 511.1MB in the end (delta: -396.4MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,086 INFO L158 Benchmark]: Witness Printer took 143.60ms. Allocated memory is still 687.9MB. Free memory was 511.1MB in the beginning and 496.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:35:14,087 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 119.5MB. Free memory is still 85.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.09ms. Allocated memory is still 216.0MB. Free memory was 148.4MB in the beginning and 174.6MB in the end (delta: -26.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.42ms. Allocated memory is still 216.0MB. Free memory was 174.6MB in the beginning and 165.1MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.65ms. Allocated memory is still 216.0MB. Free memory was 165.1MB in the beginning and 152.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1020.65ms. Allocated memory is still 216.0MB. Free memory was 151.6MB in the beginning and 115.7MB in the end (delta: 35.9MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13176.69ms. Allocated memory was 216.0MB in the beginning and 687.9MB in the end (delta: 471.9MB). Free memory was 114.6MB in the beginning and 511.1MB in the end (delta: -396.4MB). Peak memory consumption was 74.4MB. Max. memory is 16.1GB. * Witness Printer took 143.60ms. Allocated memory is still 687.9MB. Free memory was 511.1MB in the beginning and 496.4MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 134]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.8s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1999 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1999 mSDsluCounter, 2216 SdHoareTripleChecker+Invalid, 5.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 69 mSDsCounter, 883 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7154 IncrementalHoareTripleChecker+Invalid, 8037 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 883 mSolverCounterUnsat, 2147 mSDtfsCounter, 7154 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1460 GetRequests, 1438 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3741occurred in iteration=12, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 2318 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 6151 NumberOfCodeBlocks, 6151 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 6134 ConstructedInterpolants, 0 QuantifiedInterpolants, 13352 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1758 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 10128/10393 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: (((((((a24 == 1) && (a15 <= 7)) && (((long long) 49 + a12) <= 0)) || ((((long long) 49 + a12) <= 0) && (a15 <= 5))) || ((a24 == 1) && (0 <= ((long long) a12 + 42)))) || ((a24 == 1) && (a15 <= 5))) || ((a24 == 1) && (7 <= a21))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:35:14,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE