./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 16:48:54,660 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 16:48:54,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 16:48:54,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 16:48:54,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 16:48:54,781 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 16:48:54,781 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 16:48:54,782 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 16:48:54,782 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 16:48:54,783 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 16:48:54,783 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 16:48:54,784 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 16:48:54,785 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 16:48:54,789 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 16:48:54,789 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 16:48:54,789 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 16:48:54,790 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 16:48:54,790 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 16:48:54,790 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 16:48:54,790 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 16:48:54,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 16:48:54,793 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 16:48:54,793 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 16:48:54,793 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 16:48:54,794 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 16:48:54,794 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 16:48:54,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 16:48:54,794 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 16:48:54,795 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 16:48:54,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 16:48:54,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 16:48:54,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 16:48:54,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:54,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 16:48:54,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 16:48:54,797 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 16:48:54,797 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 16:48:54,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 16:48:54,798 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 16:48:54,798 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 16:48:54,798 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 16:48:54,807 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 16:48:54,808 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a55417a97b6239a405a0dcf0983ee9e4456c0351375b5342395e4dcb7a46d5dd [2024-11-11 16:48:55,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 16:48:55,090 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 16:48:55,093 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 16:48:55,094 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 16:48:55,094 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 16:48:55,096 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-11-11 16:48:56,558 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 16:48:56,852 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 16:48:56,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c [2024-11-11 16:48:56,878 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f468e5211/9be9f5d1041343919c6a16ad494e2084/FLAGf12a81a68 [2024-11-11 16:48:56,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f468e5211/9be9f5d1041343919c6a16ad494e2084 [2024-11-11 16:48:56,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 16:48:56,899 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 16:48:56,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:56,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 16:48:56,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 16:48:56,908 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:56" (1/1) ... [2024-11-11 16:48:56,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@233dd8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:56, skipping insertion in model container [2024-11-11 16:48:56,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 04:48:56" (1/1) ... [2024-11-11 16:48:56,978 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 16:48:57,202 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c[5541,5554] [2024-11-11 16:48:57,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:57,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 16:48:57,464 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label17.c[5541,5554] [2024-11-11 16:48:57,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 16:48:57,670 INFO L204 MainTranslator]: Completed translation [2024-11-11 16:48:57,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57 WrapperNode [2024-11-11 16:48:57,671 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 16:48:57,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:57,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 16:48:57,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 16:48:57,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:57,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:57,820 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-11 16:48:57,821 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 16:48:57,822 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 16:48:57,822 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 16:48:57,823 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 16:48:57,833 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:57,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:57,843 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:57,962 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-11 16:48:57,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:57,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:58,031 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:58,044 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:58,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:58,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:58,098 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 16:48:58,099 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 16:48:58,100 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 16:48:58,100 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 16:48:58,101 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (1/1) ... [2024-11-11 16:48:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 16:48:58,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 16:48:58,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 16:48:58,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 16:48:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 16:48:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 16:48:58,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 16:48:58,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 16:48:58,247 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 16:48:58,249 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 16:48:59,783 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-11 16:48:59,783 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 16:48:59,809 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 16:48:59,809 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 16:48:59,810 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:59 BoogieIcfgContainer [2024-11-11 16:48:59,810 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 16:48:59,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 16:48:59,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 16:48:59,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 16:48:59,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 04:48:56" (1/3) ... [2024-11-11 16:48:59,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9724bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:59, skipping insertion in model container [2024-11-11 16:48:59,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 04:48:57" (2/3) ... [2024-11-11 16:48:59,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f9724bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 04:48:59, skipping insertion in model container [2024-11-11 16:48:59,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:59" (3/3) ... [2024-11-11 16:48:59,819 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label17.c [2024-11-11 16:48:59,835 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 16:48:59,835 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 16:48:59,910 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 16:48:59,918 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;@6c33f042, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 16:48:59,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 16:48:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:48:59,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-11 16:48:59,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:48:59,933 INFO L218 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] [2024-11-11 16:48:59,934 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:48:59,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:48:59,940 INFO L85 PathProgramCache]: Analyzing trace with hash 323974986, now seen corresponding path program 1 times [2024-11-11 16:48:59,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:48:59,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911111063] [2024-11-11 16:48:59,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:48:59,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:00,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:00,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:00,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:00,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911111063] [2024-11-11 16:49:00,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911111063] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:00,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:00,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:00,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800268171] [2024-11-11 16:49:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:00,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:00,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:00,347 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:01,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:01,451 INFO L93 Difference]: Finished difference Result 776 states and 1363 transitions. [2024-11-11 16:49:01,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:01,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-11 16:49:01,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:01,464 INFO L225 Difference]: With dead ends: 776 [2024-11-11 16:49:01,465 INFO L226 Difference]: Without dead ends: 413 [2024-11-11 16:49:01,469 INFO L434 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-11-11 16:49:01,472 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 189 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:01,473 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 196 Invalid, 763 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-11 16:49:01,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2024-11-11 16:49:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 1.4585365853658536) internal successors, (598), 410 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:01,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 598 transitions. [2024-11-11 16:49:01,545 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 598 transitions. Word has length 38 [2024-11-11 16:49:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:01,546 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 598 transitions. [2024-11-11 16:49:01,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 598 transitions. [2024-11-11 16:49:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 16:49:01,549 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:01,549 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:01,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 16:49:01,550 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:01,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:01,552 INFO L85 PathProgramCache]: Analyzing trace with hash -980853214, now seen corresponding path program 1 times [2024-11-11 16:49:01,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:01,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717709461] [2024-11-11 16:49:01,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:01,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:01,797 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:01,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:01,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717709461] [2024-11-11 16:49:01,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717709461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:01,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:01,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:01,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094035469] [2024-11-11 16:49:01,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:01,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:01,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:01,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:01,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:01,801 INFO L87 Difference]: Start difference. First operand 411 states and 598 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:02,552 INFO L93 Difference]: Finished difference Result 1209 states and 1765 transitions. [2024-11-11 16:49:02,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:02,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-11 16:49:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:02,557 INFO L225 Difference]: With dead ends: 1209 [2024-11-11 16:49:02,557 INFO L226 Difference]: Without dead ends: 800 [2024-11-11 16:49:02,559 INFO L434 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-11-11 16:49:02,560 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:02,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 122 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-11 16:49:02,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 787. [2024-11-11 16:49:02,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 787 states, 786 states have (on average 1.3842239185750635) internal successors, (1088), 786 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:02,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 1088 transitions. [2024-11-11 16:49:02,597 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 1088 transitions. Word has length 106 [2024-11-11 16:49:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:02,597 INFO L471 AbstractCegarLoop]: Abstraction has 787 states and 1088 transitions. [2024-11-11 16:49:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 1088 transitions. [2024-11-11 16:49:02,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 16:49:02,601 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:02,601 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:02,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 16:49:02,601 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:02,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:02,602 INFO L85 PathProgramCache]: Analyzing trace with hash 952313213, now seen corresponding path program 1 times [2024-11-11 16:49:02,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:02,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138182463] [2024-11-11 16:49:02,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:02,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:02,917 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:02,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:02,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138182463] [2024-11-11 16:49:02,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138182463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:02,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:02,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:02,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277967020] [2024-11-11 16:49:02,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:02,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:02,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:02,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:02,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:02,920 INFO L87 Difference]: Start difference. First operand 787 states and 1088 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 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-11-11 16:49:03,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:03,550 INFO L93 Difference]: Finished difference Result 1942 states and 2629 transitions. [2024-11-11 16:49:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 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-11-11 16:49:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:03,558 INFO L225 Difference]: With dead ends: 1942 [2024-11-11 16:49:03,558 INFO L226 Difference]: Without dead ends: 1157 [2024-11-11 16:49:03,560 INFO L434 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-11-11 16:49:03,562 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:03,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2024-11-11 16:49:03,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 1156. [2024-11-11 16:49:03,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1156 states, 1155 states have (on average 1.277056277056277) internal successors, (1475), 1155 states have internal predecessors, (1475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:03,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1475 transitions. [2024-11-11 16:49:03,592 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1475 transitions. Word has length 108 [2024-11-11 16:49:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:03,592 INFO L471 AbstractCegarLoop]: Abstraction has 1156 states and 1475 transitions. [2024-11-11 16:49:03,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 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-11-11 16:49:03,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1475 transitions. [2024-11-11 16:49:03,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-11 16:49:03,597 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:03,598 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:03,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-11 16:49:03,598 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:03,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:03,599 INFO L85 PathProgramCache]: Analyzing trace with hash 893192678, now seen corresponding path program 1 times [2024-11-11 16:49:03,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:03,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746188610] [2024-11-11 16:49:03,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:03,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-11 16:49:03,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:03,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746188610] [2024-11-11 16:49:03,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746188610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:03,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:03,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 16:49:03,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281169942] [2024-11-11 16:49:03,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:03,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:03,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:03,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:03,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:03,891 INFO L87 Difference]: Start difference. First operand 1156 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:04,645 INFO L93 Difference]: Finished difference Result 2502 states and 3336 transitions. [2024-11-11 16:49:04,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:04,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-11 16:49:04,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:04,651 INFO L225 Difference]: With dead ends: 2502 [2024-11-11 16:49:04,651 INFO L226 Difference]: Without dead ends: 1532 [2024-11-11 16:49:04,653 INFO L434 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-11-11 16:49:04,654 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 108 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:04,654 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 156 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:04,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1532 states. [2024-11-11 16:49:04,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1532 to 1532. [2024-11-11 16:49:04,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1532 states, 1531 states have (on average 1.2612671456564337) internal successors, (1931), 1531 states have internal predecessors, (1931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1532 states to 1532 states and 1931 transitions. [2024-11-11 16:49:04,682 INFO L78 Accepts]: Start accepts. Automaton has 1532 states and 1931 transitions. Word has length 150 [2024-11-11 16:49:04,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:04,683 INFO L471 AbstractCegarLoop]: Abstraction has 1532 states and 1931 transitions. [2024-11-11 16:49:04,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1532 states and 1931 transitions. [2024-11-11 16:49:04,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 16:49:04,685 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:04,685 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:04,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-11 16:49:04,686 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:04,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:04,686 INFO L85 PathProgramCache]: Analyzing trace with hash -415130689, now seen corresponding path program 1 times [2024-11-11 16:49:04,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:04,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6839031] [2024-11-11 16:49:04,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:04,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:04,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:04,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6839031] [2024-11-11 16:49:04,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6839031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:04,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:04,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:04,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577719850] [2024-11-11 16:49:04,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:04,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:04,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:04,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:04,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:04,893 INFO L87 Difference]: Start difference. First operand 1532 states and 1931 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:05,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:05,610 INFO L93 Difference]: Finished difference Result 3644 states and 4735 transitions. [2024-11-11 16:49:05,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:05,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 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 165 [2024-11-11 16:49:05,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:05,618 INFO L225 Difference]: With dead ends: 3644 [2024-11-11 16:49:05,619 INFO L226 Difference]: Without dead ends: 2298 [2024-11-11 16:49:05,621 INFO L434 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-11-11 16:49:05,622 INFO L435 NwaCegarLoop]: 290 mSDtfsCounter, 197 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:05,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:05,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2298 states. [2024-11-11 16:49:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2298 to 2295. [2024-11-11 16:49:05,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2295 states, 2294 states have (on average 1.2650392327811684) internal successors, (2902), 2294 states have internal predecessors, (2902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:05,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2295 states to 2295 states and 2902 transitions. [2024-11-11 16:49:05,661 INFO L78 Accepts]: Start accepts. Automaton has 2295 states and 2902 transitions. Word has length 165 [2024-11-11 16:49:05,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:05,662 INFO L471 AbstractCegarLoop]: Abstraction has 2295 states and 2902 transitions. [2024-11-11 16:49:05,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:05,662 INFO L276 IsEmpty]: Start isEmpty. Operand 2295 states and 2902 transitions. [2024-11-11 16:49:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-11 16:49:05,665 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:05,665 INFO L218 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, 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, 1] [2024-11-11 16:49:05,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-11 16:49:05,666 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:05,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash -406031591, now seen corresponding path program 1 times [2024-11-11 16:49:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:05,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220253230] [2024-11-11 16:49:05,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:05,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:05,913 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-11 16:49:05,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:05,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220253230] [2024-11-11 16:49:05,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220253230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:05,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:05,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:05,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017909946] [2024-11-11 16:49:05,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:05,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:05,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:05,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:05,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:05,916 INFO L87 Difference]: Start difference. First operand 2295 states and 2902 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:06,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:06,722 INFO L93 Difference]: Finished difference Result 5522 states and 7084 transitions. [2024-11-11 16:49:06,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:06,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 220 [2024-11-11 16:49:06,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:06,736 INFO L225 Difference]: With dead ends: 5522 [2024-11-11 16:49:06,736 INFO L226 Difference]: Without dead ends: 3413 [2024-11-11 16:49:06,740 INFO L434 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-11-11 16:49:06,743 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 159 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:06,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:49:06,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3413 states. [2024-11-11 16:49:06,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3413 to 3216. [2024-11-11 16:49:06,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3215 states have (on average 1.2320373250388803) internal successors, (3961), 3215 states have internal predecessors, (3961), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:06,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 3961 transitions. [2024-11-11 16:49:06,805 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 3961 transitions. Word has length 220 [2024-11-11 16:49:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:06,805 INFO L471 AbstractCegarLoop]: Abstraction has 3216 states and 3961 transitions. [2024-11-11 16:49:06,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 3961 transitions. [2024-11-11 16:49:06,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2024-11-11 16:49:06,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:06,810 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:06,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 16:49:06,810 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:06,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash 379079722, now seen corresponding path program 1 times [2024-11-11 16:49:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:06,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26578768] [2024-11-11 16:49:06,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:06,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:06,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-11 16:49:07,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:07,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26578768] [2024-11-11 16:49:07,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26578768] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:07,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:07,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:07,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361344019] [2024-11-11 16:49:07,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:07,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:07,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:07,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:07,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:07,050 INFO L87 Difference]: Start difference. First operand 3216 states and 3961 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:07,743 INFO L93 Difference]: Finished difference Result 8087 states and 10094 transitions. [2024-11-11 16:49:07,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:07,744 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 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 226 [2024-11-11 16:49:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:07,761 INFO L225 Difference]: With dead ends: 8087 [2024-11-11 16:49:07,762 INFO L226 Difference]: Without dead ends: 4873 [2024-11-11 16:49:07,767 INFO L434 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-11-11 16:49:07,767 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 173 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:07,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 144 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4873 states. [2024-11-11 16:49:07,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4873 to 4873. [2024-11-11 16:49:07,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4873 states, 4872 states have (on average 1.2270114942528736) internal successors, (5978), 4872 states have internal predecessors, (5978), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:07,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4873 states to 4873 states and 5978 transitions. [2024-11-11 16:49:07,850 INFO L78 Accepts]: Start accepts. Automaton has 4873 states and 5978 transitions. Word has length 226 [2024-11-11 16:49:07,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:07,851 INFO L471 AbstractCegarLoop]: Abstraction has 4873 states and 5978 transitions. [2024-11-11 16:49:07,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:07,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4873 states and 5978 transitions. [2024-11-11 16:49:07,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2024-11-11 16:49:07,855 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:07,856 INFO L218 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, 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, 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] [2024-11-11 16:49:07,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 16:49:07,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:07,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:07,857 INFO L85 PathProgramCache]: Analyzing trace with hash -596698309, now seen corresponding path program 1 times [2024-11-11 16:49:07,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:07,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365353389] [2024-11-11 16:49:07,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:07,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:08,127 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2024-11-11 16:49:08,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:08,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365353389] [2024-11-11 16:49:08,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365353389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:08,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:08,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:08,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412917673] [2024-11-11 16:49:08,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:08,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:08,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:08,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:08,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:08,129 INFO L87 Difference]: Start difference. First operand 4873 states and 5978 transitions. Second operand has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:08,951 INFO L93 Difference]: Finished difference Result 11043 states and 13689 transitions. [2024-11-11 16:49:08,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:08,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 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 257 [2024-11-11 16:49:08,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:08,974 INFO L225 Difference]: With dead ends: 11043 [2024-11-11 16:49:08,975 INFO L226 Difference]: Without dead ends: 6172 [2024-11-11 16:49:08,982 INFO L434 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-11-11 16:49:08,983 INFO L435 NwaCegarLoop]: 369 mSDtfsCounter, 158 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:08,984 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 16:49:08,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6172 states. [2024-11-11 16:49:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6172 to 6162. [2024-11-11 16:49:09,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6162 states, 6161 states have (on average 1.2114916409673755) internal successors, (7464), 6161 states have internal predecessors, (7464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:09,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6162 states to 6162 states and 7464 transitions. [2024-11-11 16:49:09,122 INFO L78 Accepts]: Start accepts. Automaton has 6162 states and 7464 transitions. Word has length 257 [2024-11-11 16:49:09,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:09,123 INFO L471 AbstractCegarLoop]: Abstraction has 6162 states and 7464 transitions. [2024-11-11 16:49:09,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.0) internal successors, (162), 3 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:09,123 INFO L276 IsEmpty]: Start isEmpty. Operand 6162 states and 7464 transitions. [2024-11-11 16:49:09,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2024-11-11 16:49:09,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:09,132 INFO L218 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:09,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 16:49:09,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:09,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:09,133 INFO L85 PathProgramCache]: Analyzing trace with hash -815039662, now seen corresponding path program 1 times [2024-11-11 16:49:09,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:09,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003721745] [2024-11-11 16:49:09,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:09,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:09,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-11 16:49:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:09,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003721745] [2024-11-11 16:49:09,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003721745] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:09,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:09,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511874531] [2024-11-11 16:49:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:09,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:09,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:09,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:09,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:09,382 INFO L87 Difference]: Start difference. First operand 6162 states and 7464 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:10,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:10,162 INFO L93 Difference]: Finished difference Result 13985 states and 17099 transitions. [2024-11-11 16:49:10,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:10,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 303 [2024-11-11 16:49:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:10,186 INFO L225 Difference]: With dead ends: 13985 [2024-11-11 16:49:10,186 INFO L226 Difference]: Without dead ends: 7825 [2024-11-11 16:49:10,194 INFO L434 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-11-11 16:49:10,195 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 198 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:10,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 60 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 16:49:10,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7825 states. [2024-11-11 16:49:10,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7825 to 7819. [2024-11-11 16:49:10,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7819 states, 7818 states have (on average 1.2196213865438732) internal successors, (9535), 7818 states have internal predecessors, (9535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:10,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7819 states to 7819 states and 9535 transitions. [2024-11-11 16:49:10,368 INFO L78 Accepts]: Start accepts. Automaton has 7819 states and 9535 transitions. Word has length 303 [2024-11-11 16:49:10,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:10,369 INFO L471 AbstractCegarLoop]: Abstraction has 7819 states and 9535 transitions. [2024-11-11 16:49:10,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:10,369 INFO L276 IsEmpty]: Start isEmpty. Operand 7819 states and 9535 transitions. [2024-11-11 16:49:10,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2024-11-11 16:49:10,379 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:10,379 INFO L218 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, 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, 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] [2024-11-11 16:49:10,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 16:49:10,380 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:10,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:10,383 INFO L85 PathProgramCache]: Analyzing trace with hash 776789019, now seen corresponding path program 1 times [2024-11-11 16:49:10,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:10,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234893045] [2024-11-11 16:49:10,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:10,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:10,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:10,585 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-11 16:49:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:10,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234893045] [2024-11-11 16:49:10,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234893045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:10,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:10,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94108052] [2024-11-11 16:49:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:10,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:10,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:10,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:10,590 INFO L87 Difference]: Start difference. First operand 7819 states and 9535 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:11,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:11,201 INFO L93 Difference]: Finished difference Result 15237 states and 18590 transitions. [2024-11-11 16:49:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:11,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 338 [2024-11-11 16:49:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:11,215 INFO L225 Difference]: With dead ends: 15237 [2024-11-11 16:49:11,215 INFO L226 Difference]: Without dead ends: 7420 [2024-11-11 16:49:11,223 INFO L434 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-11-11 16:49:11,224 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:11,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 150 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:11,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7420 states. [2024-11-11 16:49:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7420 to 7051. [2024-11-11 16:49:11,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7051 states, 7050 states have (on average 1.1554609929078015) internal successors, (8146), 7050 states have internal predecessors, (8146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7051 states to 7051 states and 8146 transitions. [2024-11-11 16:49:11,348 INFO L78 Accepts]: Start accepts. Automaton has 7051 states and 8146 transitions. Word has length 338 [2024-11-11 16:49:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:11,348 INFO L471 AbstractCegarLoop]: Abstraction has 7051 states and 8146 transitions. [2024-11-11 16:49:11,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 7051 states and 8146 transitions. [2024-11-11 16:49:11,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-11 16:49:11,360 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:11,361 INFO L218 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, 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, 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, 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] [2024-11-11 16:49:11,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 16:49:11,362 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:11,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:11,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1032835470, now seen corresponding path program 1 times [2024-11-11 16:49:11,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:11,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530113526] [2024-11-11 16:49:11,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:11,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:11,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 213 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 16:49:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530113526] [2024-11-11 16:49:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530113526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875928665] [2024-11-11 16:49:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:11,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:11,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:11,789 INFO L87 Difference]: Start difference. First operand 7051 states and 8146 transitions. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:12,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:12,842 INFO L93 Difference]: Finished difference Result 16680 states and 19252 transitions. [2024-11-11 16:49:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:12,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 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 343 [2024-11-11 16:49:12,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:12,857 INFO L225 Difference]: With dead ends: 16680 [2024-11-11 16:49:12,858 INFO L226 Difference]: Without dead ends: 9631 [2024-11-11 16:49:12,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-11 16:49:12,868 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 247 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1077 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 1077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:12,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 63 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 1077 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:12,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9631 states. [2024-11-11 16:49:12,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9631 to 7782. [2024-11-11 16:49:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7782 states, 7781 states have (on average 1.1453540676005656) internal successors, (8912), 7781 states have internal predecessors, (8912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:13,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7782 states to 7782 states and 8912 transitions. [2024-11-11 16:49:13,030 INFO L78 Accepts]: Start accepts. Automaton has 7782 states and 8912 transitions. Word has length 343 [2024-11-11 16:49:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:13,031 INFO L471 AbstractCegarLoop]: Abstraction has 7782 states and 8912 transitions. [2024-11-11 16:49:13,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 7782 states and 8912 transitions. [2024-11-11 16:49:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-11 16:49:13,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:13,047 INFO L218 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, 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:13,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 16:49:13,047 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:13,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:13,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1279990241, now seen corresponding path program 1 times [2024-11-11 16:49:13,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120876449] [2024-11-11 16:49:13,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:13,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:13,586 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 323 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-11 16:49:13,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:13,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120876449] [2024-11-11 16:49:13,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120876449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:13,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:13,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-11 16:49:13,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162985602] [2024-11-11 16:49:13,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:13,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-11 16:49:13,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:13,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-11 16:49:13,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-11 16:49:13,588 INFO L87 Difference]: Start difference. First operand 7782 states and 8912 transitions. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:14,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:14,659 INFO L93 Difference]: Finished difference Result 16852 states and 19276 transitions. [2024-11-11 16:49:14,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-11 16:49:14,660 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 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 417 [2024-11-11 16:49:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:14,674 INFO L225 Difference]: With dead ends: 16852 [2024-11-11 16:49:14,675 INFO L226 Difference]: Without dead ends: 9072 [2024-11-11 16:49:14,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-11-11 16:49:14,684 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 246 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:14,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 64 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 16:49:14,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9072 states. [2024-11-11 16:49:14,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9072 to 7414. [2024-11-11 16:49:14,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7414 states, 7413 states have (on average 1.1452853095912585) internal successors, (8490), 7413 states have internal predecessors, (8490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:14,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7414 states to 7414 states and 8490 transitions. [2024-11-11 16:49:14,786 INFO L78 Accepts]: Start accepts. Automaton has 7414 states and 8490 transitions. Word has length 417 [2024-11-11 16:49:14,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:14,787 INFO L471 AbstractCegarLoop]: Abstraction has 7414 states and 8490 transitions. [2024-11-11 16:49:14,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:14,788 INFO L276 IsEmpty]: Start isEmpty. Operand 7414 states and 8490 transitions. [2024-11-11 16:49:14,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2024-11-11 16:49:14,800 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 16:49:14,802 INFO L218 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, 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, 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-11-11 16:49:14,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 16:49:14,802 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 16:49:14,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 16:49:14,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1984851719, now seen corresponding path program 1 times [2024-11-11 16:49:14,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 16:49:14,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822460196] [2024-11-11 16:49:14,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 16:49:14,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 16:49:14,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 16:49:15,103 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2024-11-11 16:49:15,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 16:49:15,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822460196] [2024-11-11 16:49:15,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822460196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 16:49:15,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 16:49:15,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 16:49:15,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068406416] [2024-11-11 16:49:15,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 16:49:15,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 16:49:15,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 16:49:15,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 16:49:15,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 16:49:15,107 INFO L87 Difference]: Start difference. First operand 7414 states and 8490 transitions. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:15,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 16:49:15,784 INFO L93 Difference]: Finished difference Result 16111 states and 18455 transitions. [2024-11-11 16:49:15,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 16:49:15,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 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 536 [2024-11-11 16:49:15,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 16:49:15,785 INFO L225 Difference]: With dead ends: 16111 [2024-11-11 16:49:15,785 INFO L226 Difference]: Without dead ends: 0 [2024-11-11 16:49:15,796 INFO L434 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-11-11 16:49:15,797 INFO L435 NwaCegarLoop]: 335 mSDtfsCounter, 193 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 16:49:15,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 355 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 16:49:15,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-11 16:49:15,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-11 16:49:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-11 16:49:15,798 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 536 [2024-11-11 16:49:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 16:49:15,798 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-11 16:49:15,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 16:49:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-11 16:49:15,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-11 16:49:15,802 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-11 16:49:15,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 16:49:15,806 INFO L421 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 16:49:15,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-11 16:49:16,355 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-11 16:49:16,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 04:49:16 BoogieIcfgContainer [2024-11-11 16:49:16,378 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-11 16:49:16,379 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-11 16:49:16,379 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-11 16:49:16,379 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-11 16:49:16,380 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 04:48:59" (3/4) ... [2024-11-11 16:49:16,382 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-11 16:49:16,404 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-11 16:49:16,405 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-11 16:49:16,407 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-11 16:49:16,408 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-11 16:49:16,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-11 16:49:16,584 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-11 16:49:16,584 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-11 16:49:16,585 INFO L158 Benchmark]: Toolchain (without parser) took 19686.15ms. Allocated memory was 178.3MB in the beginning and 526.4MB in the end (delta: 348.1MB). Free memory was 117.8MB in the beginning and 319.4MB in the end (delta: -201.6MB). Peak memory consumption was 147.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,585 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-11 16:49:16,586 INFO L158 Benchmark]: CACSL2BoogieTranslator took 770.45ms. Allocated memory is still 178.3MB. Free memory was 117.8MB in the beginning and 69.1MB in the end (delta: 48.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,586 INFO L158 Benchmark]: Boogie Procedure Inliner took 149.07ms. Allocated memory is still 178.3MB. Free memory was 69.1MB in the beginning and 51.5MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,586 INFO L158 Benchmark]: Boogie Preprocessor took 276.12ms. Allocated memory was 178.3MB in the beginning and 255.9MB in the end (delta: 77.6MB). Free memory was 51.5MB in the beginning and 194.2MB in the end (delta: -142.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,587 INFO L158 Benchmark]: RCFGBuilder took 1710.45ms. Allocated memory is still 255.9MB. Free memory was 194.2MB in the beginning and 133.1MB in the end (delta: 61.1MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,587 INFO L158 Benchmark]: TraceAbstraction took 16565.13ms. Allocated memory was 255.9MB in the beginning and 526.4MB in the end (delta: 270.5MB). Free memory was 132.1MB in the beginning and 336.1MB in the end (delta: -204.1MB). Peak memory consumption was 298.2MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,588 INFO L158 Benchmark]: Witness Printer took 205.45ms. Allocated memory is still 526.4MB. Free memory was 336.1MB in the beginning and 319.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-11 16:49:16,589 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 178.3MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 770.45ms. Allocated memory is still 178.3MB. Free memory was 117.8MB in the beginning and 69.1MB in the end (delta: 48.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 149.07ms. Allocated memory is still 178.3MB. Free memory was 69.1MB in the beginning and 51.5MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 276.12ms. Allocated memory was 178.3MB in the beginning and 255.9MB in the end (delta: 77.6MB). Free memory was 51.5MB in the beginning and 194.2MB in the end (delta: -142.7MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1710.45ms. Allocated memory is still 255.9MB. Free memory was 194.2MB in the beginning and 133.1MB in the end (delta: 61.1MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16565.13ms. Allocated memory was 255.9MB in the beginning and 526.4MB in the end (delta: 270.5MB). Free memory was 132.1MB in the beginning and 336.1MB in the end (delta: -204.1MB). Peak memory consumption was 298.2MB. Max. memory is 16.1GB. * Witness Printer took 205.45ms. Allocated memory is still 526.4MB. Free memory was 336.1MB in the beginning and 319.4MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. 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: 130]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.9s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2250 SdHoareTripleChecker+Valid, 9.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2250 mSDsluCounter, 2605 SdHoareTripleChecker+Invalid, 8.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 298 mSDsCounter, 1516 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8270 IncrementalHoareTripleChecker+Invalid, 9786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1516 mSolverCounterUnsat, 2307 mSDtfsCounter, 8270 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7819occurred in iteration=9, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 4108 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 3207 NumberOfCodeBlocks, 3207 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3194 ConstructedInterpolants, 0 QuantifiedInterpolants, 5658 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 2651/2651 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: 1044]: Loop Invariant Derived loop invariant: (((((((((a25 == 13) && (a29 <= 599998)) && (a4 == 1)) || ((a29 <= 277) && (a4 == 0))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || ((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (a25 <= 10)) && (a29 <= 599998))) || ((a29 <= 277) && (a4 == 1))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || (((a4 == 0) && (a25 == 11)) && (a29 <= 599998))) RESULT: Ultimate proved your program to be correct! [2024-11-11 16:49:16,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE