./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label10.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aeaa951d8e8580b5c332234156773ae22fea12bbbe739a78054c027b3309c22c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:15:58,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:15:58,706 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:15:58,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:15:58,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:15:58,739 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:15:58,739 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:15:58,739 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:15:58,740 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:15:58,743 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:15:58,743 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:15:58,744 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:15:58,744 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:15:58,744 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:15:58,745 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:15:58,745 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:15:58,745 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:15:58,746 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:15:58,746 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:15:58,749 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:15:58,749 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:15:58,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:15:58,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:15:58,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:15:58,750 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:15:58,751 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:15:58,751 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:15:58,751 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:15:58,752 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:15:58,752 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:15:58,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:15:58,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:15:58,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:15:58,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:15:58,754 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:15:58,754 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:15:58,754 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:15:58,754 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:15:58,754 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:15:58,754 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:15:58,755 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:15:58,755 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:15:58,755 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aeaa951d8e8580b5c332234156773ae22fea12bbbe739a78054c027b3309c22c [2024-10-10 23:15:59,075 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:15:59,096 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:15:59,099 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:15:59,100 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:15:59,101 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:15:59,102 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label10.c [2024-10-10 23:16:00,518 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:16:00,780 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:16:00,780 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label10.c [2024-10-10 23:16:00,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a67fea02/c5f1f331e42843ac89cee97afd08d77c/FLAG431696594 [2024-10-10 23:16:01,105 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a67fea02/c5f1f331e42843ac89cee97afd08d77c [2024-10-10 23:16:01,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:16:01,109 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:16:01,112 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:01,112 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:16:01,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:16:01,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74708e47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01, skipping insertion in model container [2024-10-10 23:16:01,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:16:01,422 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label10.c[5544,5557] [2024-10-10 23:16:01,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:01,587 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:16:01,618 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label10.c[5544,5557] [2024-10-10 23:16:01,727 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:16:01,752 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:16:01,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01 WrapperNode [2024-10-10 23:16:01,753 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:16:01,754 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:01,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:16:01,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:16:01,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,873 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 598 [2024-10-10 23:16:01,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:16:01,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:16:01,875 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:16:01,875 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:16:01,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,897 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,942 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:16:01,944 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,944 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,984 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:01,997 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:02,003 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:02,014 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:16:02,016 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:16:02,016 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:16:02,016 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:16:02,017 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (1/1) ... [2024-10-10 23:16:02,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:16:02,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:02,055 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:16:02,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:16:02,106 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:16:02,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:16:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:16:02,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:16:02,194 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:16:02,197 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:16:03,309 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 23:16:03,309 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:16:03,365 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:16:03,365 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:16:03,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:03 BoogieIcfgContainer [2024-10-10 23:16:03,366 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:16:03,367 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:16:03,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:16:03,370 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:16:03,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:16:01" (1/3) ... [2024-10-10 23:16:03,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a83d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:03, skipping insertion in model container [2024-10-10 23:16:03,371 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:16:01" (2/3) ... [2024-10-10 23:16:03,371 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a83d4b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:16:03, skipping insertion in model container [2024-10-10 23:16:03,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:03" (3/3) ... [2024-10-10 23:16:03,373 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label10.c [2024-10-10 23:16:03,386 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:16:03,386 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:16:03,448 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:16:03,454 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;@1367f0ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:16:03,454 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:16:03,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:03,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 23:16:03,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:03,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:03,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:03,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:03,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1952605903, now seen corresponding path program 1 times [2024-10-10 23:16:03,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550835391] [2024-10-10 23:16:03,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:03,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550835391] [2024-10-10 23:16:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550835391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:03,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593318529] [2024-10-10 23:16:03,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:03,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:16:03,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:16:03,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:03,717 INFO L87 Difference]: Start difference. First operand has 144 states, 142 states have (on average 1.9859154929577465) internal successors, (282), 143 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:03,757 INFO L93 Difference]: Finished difference Result 287 states and 563 transitions. [2024-10-10 23:16:03,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:16:03,759 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-10 23:16:03,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:03,767 INFO L225 Difference]: With dead ends: 287 [2024-10-10 23:16:03,767 INFO L226 Difference]: Without dead ends: 142 [2024-10-10 23:16:03,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:16:03,773 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:03,774 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 217 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:16:03,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-10 23:16:03,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2024-10-10 23:16:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 1.5390070921985815) internal successors, (217), 141 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:03,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 217 transitions. [2024-10-10 23:16:03,809 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 217 transitions. Word has length 47 [2024-10-10 23:16:03,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:03,809 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 217 transitions. [2024-10-10 23:16:03,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 217 transitions. [2024-10-10 23:16:03,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-10 23:16:03,811 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:03,811 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:03,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:16:03,811 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:03,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:03,812 INFO L85 PathProgramCache]: Analyzing trace with hash 769417373, now seen corresponding path program 1 times [2024-10-10 23:16:03,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:03,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166094514] [2024-10-10 23:16:03,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:03,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:03,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:04,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:04,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166094514] [2024-10-10 23:16:04,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166094514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:04,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:04,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:04,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907884558] [2024-10-10 23:16:04,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:04,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:04,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:04,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:04,092 INFO L87 Difference]: Start difference. First operand 142 states and 217 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:04,720 INFO L93 Difference]: Finished difference Result 422 states and 648 transitions. [2024-10-10 23:16:04,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:04,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-10-10 23:16:04,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:04,723 INFO L225 Difference]: With dead ends: 422 [2024-10-10 23:16:04,723 INFO L226 Difference]: Without dead ends: 281 [2024-10-10 23:16:04,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:04,725 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 99 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:04,726 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 65 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:16:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-10-10 23:16:04,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2024-10-10 23:16:04,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 1.3428571428571427) internal successors, (376), 280 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 376 transitions. [2024-10-10 23:16:04,747 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 376 transitions. Word has length 47 [2024-10-10 23:16:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:04,748 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 376 transitions. [2024-10-10 23:16:04,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 376 transitions. [2024-10-10 23:16:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-10 23:16:04,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:04,752 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-10-10 23:16:04,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:16:04,752 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:04,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 242075881, now seen corresponding path program 1 times [2024-10-10 23:16:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:04,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721471775] [2024-10-10 23:16:04,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:04,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:05,179 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-10 23:16:05,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:05,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721471775] [2024-10-10 23:16:05,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721471775] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:05,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252391046] [2024-10-10 23:16:05,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:05,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:05,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:05,184 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:05,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 23:16:05,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:05,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:05,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:05,505 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-10 23:16:05,507 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:05,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252391046] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:05,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:05,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:16:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313570928] [2024-10-10 23:16:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:05,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:05,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:05,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:16:05,512 INFO L87 Difference]: Start difference. First operand 281 states and 376 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:06,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:06,035 INFO L93 Difference]: Finished difference Result 561 states and 751 transitions. [2024-10-10 23:16:06,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:06,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 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 113 [2024-10-10 23:16:06,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:06,039 INFO L225 Difference]: With dead ends: 561 [2024-10-10 23:16:06,039 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:16:06,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:16:06,041 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 114 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:06,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 9 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:06,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:16:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 420. [2024-10-10 23:16:06,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 419 states have (on average 1.4081145584725536) internal successors, (590), 419 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 590 transitions. [2024-10-10 23:16:06,067 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 590 transitions. Word has length 113 [2024-10-10 23:16:06,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:06,069 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 590 transitions. [2024-10-10 23:16:06,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 2 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 590 transitions. [2024-10-10 23:16:06,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-10 23:16:06,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:06,074 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:06,091 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 23:16:06,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:06,275 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:06,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:06,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1359686896, now seen corresponding path program 1 times [2024-10-10 23:16:06,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:06,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541349600] [2024-10-10 23:16:06,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:06,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:06,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:06,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:06,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541349600] [2024-10-10 23:16:06,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541349600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:06,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:06,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:06,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430692192] [2024-10-10 23:16:06,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:06,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:06,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:06,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:06,531 INFO L87 Difference]: Start difference. First operand 420 states and 590 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-10-10 23:16:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:06,958 INFO L93 Difference]: Finished difference Result 978 states and 1338 transitions. [2024-10-10 23:16:06,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:06,959 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 116 [2024-10-10 23:16:06,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:06,961 INFO L225 Difference]: With dead ends: 978 [2024-10-10 23:16:06,962 INFO L226 Difference]: Without dead ends: 559 [2024-10-10 23:16:06,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:06,968 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 72 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:06,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 75 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:06,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2024-10-10 23:16:06,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 559. [2024-10-10 23:16:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 558 states have (on average 1.3243727598566308) internal successors, (739), 558 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:06,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 739 transitions. [2024-10-10 23:16:06,994 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 739 transitions. Word has length 116 [2024-10-10 23:16:06,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:06,995 INFO L471 AbstractCegarLoop]: Abstraction has 559 states and 739 transitions. [2024-10-10 23:16:06,995 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-10-10 23:16:06,995 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 739 transitions. [2024-10-10 23:16:07,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-10 23:16:07,003 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:07,003 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:07,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:16:07,004 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:07,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:07,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1398702273, now seen corresponding path program 1 times [2024-10-10 23:16:07,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:07,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591102384] [2024-10-10 23:16:07,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:07,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:07,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:07,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591102384] [2024-10-10 23:16:07,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591102384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:07,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:07,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:07,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712302188] [2024-10-10 23:16:07,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:07,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:07,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:07,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:07,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:07,154 INFO L87 Difference]: Start difference. First operand 559 states and 739 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:07,659 INFO L93 Difference]: Finished difference Result 1256 states and 1757 transitions. [2024-10-10 23:16:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:07,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 122 [2024-10-10 23:16:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:07,663 INFO L225 Difference]: With dead ends: 1256 [2024-10-10 23:16:07,663 INFO L226 Difference]: Without dead ends: 837 [2024-10-10 23:16:07,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:07,665 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 94 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:07,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 223 Invalid, 446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:07,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-10 23:16:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 698. [2024-10-10 23:16:07,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 697 states have (on average 1.309899569583931) internal successors, (913), 697 states have internal predecessors, (913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 913 transitions. [2024-10-10 23:16:07,679 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 913 transitions. Word has length 122 [2024-10-10 23:16:07,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:07,680 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 913 transitions. [2024-10-10 23:16:07,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:07,681 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 913 transitions. [2024-10-10 23:16:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-10-10 23:16:07,683 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:07,683 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:07,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:16:07,683 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:07,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:07,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1830741436, now seen corresponding path program 1 times [2024-10-10 23:16:07,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:07,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731176745] [2024-10-10 23:16:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:07,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:07,841 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:16:07,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:07,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731176745] [2024-10-10 23:16:07,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731176745] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:07,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:07,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:16:07,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006391722] [2024-10-10 23:16:07,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:07,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:07,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:07,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:07,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:07,844 INFO L87 Difference]: Start difference. First operand 698 states and 913 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:08,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:08,303 INFO L93 Difference]: Finished difference Result 1534 states and 2009 transitions. [2024-10-10 23:16:08,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:08,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2024-10-10 23:16:08,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:08,311 INFO L225 Difference]: With dead ends: 1534 [2024-10-10 23:16:08,311 INFO L226 Difference]: Without dead ends: 976 [2024-10-10 23:16:08,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:08,313 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 107 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:08,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 32 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2024-10-10 23:16:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2024-10-10 23:16:08,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 1.1907692307692308) internal successors, (1161), 975 states have internal predecessors, (1161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:08,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1161 transitions. [2024-10-10 23:16:08,329 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1161 transitions. Word has length 182 [2024-10-10 23:16:08,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:08,330 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1161 transitions. [2024-10-10 23:16:08,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:08,330 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1161 transitions. [2024-10-10 23:16:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-10-10 23:16:08,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:08,332 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:08,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:16:08,333 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:08,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:08,333 INFO L85 PathProgramCache]: Analyzing trace with hash -2013810493, now seen corresponding path program 1 times [2024-10-10 23:16:08,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:08,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624601147] [2024-10-10 23:16:08,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:08,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:08,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:08,491 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:08,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:08,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624601147] [2024-10-10 23:16:08,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624601147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:08,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:08,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:08,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252389960] [2024-10-10 23:16:08,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:08,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:08,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:08,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:08,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:08,494 INFO L87 Difference]: Start difference. First operand 976 states and 1161 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:08,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:08,941 INFO L93 Difference]: Finished difference Result 2090 states and 2556 transitions. [2024-10-10 23:16:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:08,942 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2024-10-10 23:16:08,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:08,946 INFO L225 Difference]: With dead ends: 2090 [2024-10-10 23:16:08,946 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:16:08,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:08,948 INFO L432 NwaCegarLoop]: 207 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:08,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 210 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:08,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:16:08,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-10 23:16:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1652035115722266) internal successors, (1460), 1253 states have internal predecessors, (1460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1460 transitions. [2024-10-10 23:16:08,969 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1460 transitions. Word has length 199 [2024-10-10 23:16:08,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:08,970 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1460 transitions. [2024-10-10 23:16:08,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1460 transitions. [2024-10-10 23:16:08,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2024-10-10 23:16:08,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:08,974 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:08,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:16:08,974 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:08,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:08,975 INFO L85 PathProgramCache]: Analyzing trace with hash 168827208, now seen corresponding path program 1 times [2024-10-10 23:16:08,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:08,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100807665] [2024-10-10 23:16:08,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:08,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:09,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:09,473 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:09,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:09,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100807665] [2024-10-10 23:16:09,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100807665] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:16:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013763520] [2024-10-10 23:16:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:16:09,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:09,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:16:09,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:09,477 INFO L87 Difference]: Start difference. First operand 1254 states and 1460 transitions. Second operand has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:10,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:10,107 INFO L93 Difference]: Finished difference Result 2423 states and 2830 transitions. [2024-10-10 23:16:10,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:16:10,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 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 254 [2024-10-10 23:16:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:10,113 INFO L225 Difference]: With dead ends: 2423 [2024-10-10 23:16:10,113 INFO L226 Difference]: Without dead ends: 1254 [2024-10-10 23:16:10,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:10,115 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 142 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:10,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:16:10,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2024-10-10 23:16:10,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2024-10-10 23:16:10,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1612130885873904) internal successors, (1455), 1253 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1455 transitions. [2024-10-10 23:16:10,142 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1455 transitions. Word has length 254 [2024-10-10 23:16:10,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:10,142 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1455 transitions. [2024-10-10 23:16:10,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.285714285714285) internal successors, (254), 6 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:10,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1455 transitions. [2024-10-10 23:16:10,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2024-10-10 23:16:10,146 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:10,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:10,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:16:10,148 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:10,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:10,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1487606674, now seen corresponding path program 1 times [2024-10-10 23:16:10,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:10,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81191626] [2024-10-10 23:16:10,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:10,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:10,371 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-10-10 23:16:10,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:10,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81191626] [2024-10-10 23:16:10,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81191626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:10,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:10,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:10,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427908033] [2024-10-10 23:16:10,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:10,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:10,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:10,377 INFO L87 Difference]: Start difference. First operand 1254 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:10,847 INFO L93 Difference]: Finished difference Result 1812 states and 2097 transitions. [2024-10-10 23:16:10,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:10,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 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 290 [2024-10-10 23:16:10,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:10,854 INFO L225 Difference]: With dead ends: 1812 [2024-10-10 23:16:10,855 INFO L226 Difference]: Without dead ends: 1810 [2024-10-10 23:16:10,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:10,856 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:10,858 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 9 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:10,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-10-10 23:16:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1254. [2024-10-10 23:16:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1612130885873904) internal successors, (1455), 1253 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1455 transitions. [2024-10-10 23:16:10,884 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1455 transitions. Word has length 290 [2024-10-10 23:16:10,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:10,884 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1455 transitions. [2024-10-10 23:16:10,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.333333333333336) internal successors, (181), 3 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:10,885 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1455 transitions. [2024-10-10 23:16:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-10-10 23:16:10,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:10,889 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2024-10-10 23:16:10,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:16:10,890 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash 2104536706, now seen corresponding path program 1 times [2024-10-10 23:16:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745312165] [2024-10-10 23:16:10,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:10,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-10-10 23:16:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745312165] [2024-10-10 23:16:11,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745312165] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:11,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:11,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:11,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427646218] [2024-10-10 23:16:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:11,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:11,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:11,123 INFO L87 Difference]: Start difference. First operand 1254 states and 1455 transitions. Second operand has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:11,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:11,566 INFO L93 Difference]: Finished difference Result 1395 states and 1604 transitions. [2024-10-10 23:16:11,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:11,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 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 325 [2024-10-10 23:16:11,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:11,571 INFO L225 Difference]: With dead ends: 1395 [2024-10-10 23:16:11,571 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:16:11,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:11,572 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:11,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 9 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:11,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:16:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1115. [2024-10-10 23:16:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1115 states, 1114 states have (on average 1.1714542190305206) internal successors, (1305), 1114 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:11,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1305 transitions. [2024-10-10 23:16:11,593 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1305 transitions. Word has length 325 [2024-10-10 23:16:11,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:11,594 INFO L471 AbstractCegarLoop]: Abstraction has 1115 states and 1305 transitions. [2024-10-10 23:16:11,594 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.666666666666664) internal successors, (161), 3 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:11,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1305 transitions. [2024-10-10 23:16:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2024-10-10 23:16:11,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:11,598 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:16:11,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1290547486, now seen corresponding path program 1 times [2024-10-10 23:16:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627409878] [2024-10-10 23:16:11,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:11,899 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-10-10 23:16:11,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:11,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627409878] [2024-10-10 23:16:11,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627409878] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:11,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:11,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:11,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675341986] [2024-10-10 23:16:11,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:11,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:11,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:11,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:11,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:11,902 INFO L87 Difference]: Start difference. First operand 1115 states and 1305 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-10-10 23:16:12,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:12,348 INFO L93 Difference]: Finished difference Result 2368 states and 2843 transitions. [2024-10-10 23:16:12,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:12,348 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 346 [2024-10-10 23:16:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:12,354 INFO L225 Difference]: With dead ends: 2368 [2024-10-10 23:16:12,354 INFO L226 Difference]: Without dead ends: 1393 [2024-10-10 23:16:12,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:12,356 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 95 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:12,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 212 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:12,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2024-10-10 23:16:12,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 1254. [2024-10-10 23:16:12,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.1644054269752593) internal successors, (1459), 1253 states have internal predecessors, (1459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1459 transitions. [2024-10-10 23:16:12,378 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1459 transitions. Word has length 346 [2024-10-10 23:16:12,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:12,379 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1459 transitions. [2024-10-10 23:16:12,379 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-10-10 23:16:12,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1459 transitions. [2024-10-10 23:16:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2024-10-10 23:16:12,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:12,385 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:12,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:16:12,385 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:12,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:12,386 INFO L85 PathProgramCache]: Analyzing trace with hash -223553603, now seen corresponding path program 1 times [2024-10-10 23:16:12,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:12,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726675109] [2024-10-10 23:16:12,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:12,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 337 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:16:12,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:12,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726675109] [2024-10-10 23:16:12,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726675109] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:16:12,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899169218] [2024-10-10 23:16:12,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:12,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:16:12,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:16:12,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 23:16:12,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:12,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:16:12,996 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:16:13,183 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 315 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-10-10 23:16:13,183 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:16:13,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899169218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:13,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:16:13,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:16:13,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961723050] [2024-10-10 23:16:13,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:13,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:13,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:13,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:13,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:13,186 INFO L87 Difference]: Start difference. First operand 1254 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:13,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:13,673 INFO L93 Difference]: Finished difference Result 3202 states and 3741 transitions. [2024-10-10 23:16:13,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:13,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 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 347 [2024-10-10 23:16:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:13,682 INFO L225 Difference]: With dead ends: 3202 [2024-10-10 23:16:13,683 INFO L226 Difference]: Without dead ends: 2088 [2024-10-10 23:16:13,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 346 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:16:13,685 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:13,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 201 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:16:13,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2024-10-10 23:16:13,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2088. [2024-10-10 23:16:13,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2088 states, 2087 states have (on average 1.1346430282702444) internal successors, (2368), 2087 states have internal predecessors, (2368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2088 states to 2088 states and 2368 transitions. [2024-10-10 23:16:13,725 INFO L78 Accepts]: Start accepts. Automaton has 2088 states and 2368 transitions. Word has length 347 [2024-10-10 23:16:13,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:13,726 INFO L471 AbstractCegarLoop]: Abstraction has 2088 states and 2368 transitions. [2024-10-10 23:16:13,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.66666666666667) internal successors, (281), 3 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:13,727 INFO L276 IsEmpty]: Start isEmpty. Operand 2088 states and 2368 transitions. [2024-10-10 23:16:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2024-10-10 23:16:13,732 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:16:13,733 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:16:13,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-10 23:16:13,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:16:13,934 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:16:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:16:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash -54030173, now seen corresponding path program 1 times [2024-10-10 23:16:13,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:16:13,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522831613] [2024-10-10 23:16:13,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:16:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:16:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:16:14,207 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 271 trivial. 0 not checked. [2024-10-10 23:16:14,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:16:14,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522831613] [2024-10-10 23:16:14,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522831613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:16:14,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:16:14,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:16:14,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632267418] [2024-10-10 23:16:14,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:16:14,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:16:14,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:16:14,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:16:14,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:14,209 INFO L87 Difference]: Start difference. First operand 2088 states and 2368 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:14,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:16:14,668 INFO L93 Difference]: Finished difference Result 4034 states and 4591 transitions. [2024-10-10 23:16:14,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:16:14,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 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 360 [2024-10-10 23:16:14,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:16:14,671 INFO L225 Difference]: With dead ends: 4034 [2024-10-10 23:16:14,671 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:16:14,675 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:16:14,676 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 98 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:16:14,676 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 209 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:16:14,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:16:14,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:16:14,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:14,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:16:14,678 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 360 [2024-10-10 23:16:14,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:16:14,678 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:16:14,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 3 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:16:14,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:16:14,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:16:14,681 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:16:14,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:16:14,685 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:16:14,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:16:15,022 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:16:15,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:16:15 BoogieIcfgContainer [2024-10-10 23:16:15,046 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:16:15,046 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:16:15,047 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:16:15,047 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:16:15,047 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:16:03" (3/4) ... [2024-10-10 23:16:15,049 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:16:15,068 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:16:15,069 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:16:15,070 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:16:15,072 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:16:15,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:16:15,240 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:16:15,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:16:15,241 INFO L158 Benchmark]: Toolchain (without parser) took 14131.20ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 89.8MB in the beginning and 262.1MB in the end (delta: -172.3MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,241 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 165.7MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:16:15,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 641.54ms. Allocated memory is still 165.7MB. Free memory was 89.8MB in the beginning and 131.8MB in the end (delta: -42.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 120.20ms. Allocated memory is still 165.7MB. Free memory was 131.8MB in the beginning and 123.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,242 INFO L158 Benchmark]: Boogie Preprocessor took 139.63ms. Allocated memory is still 165.7MB. Free memory was 123.4MB in the beginning and 113.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,242 INFO L158 Benchmark]: RCFGBuilder took 1350.08ms. Allocated memory is still 165.7MB. Free memory was 113.8MB in the beginning and 94.6MB in the end (delta: 19.2MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,243 INFO L158 Benchmark]: TraceAbstraction took 11678.51ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 94.6MB in the beginning and 274.7MB in the end (delta: -180.2MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,243 INFO L158 Benchmark]: Witness Printer took 193.48ms. Allocated memory is still 356.5MB. Free memory was 274.7MB in the beginning and 262.1MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:16:15,248 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 165.7MB. Free memory is still 136.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 641.54ms. Allocated memory is still 165.7MB. Free memory was 89.8MB in the beginning and 131.8MB in the end (delta: -42.0MB). Peak memory consumption was 34.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 120.20ms. Allocated memory is still 165.7MB. Free memory was 131.8MB in the beginning and 123.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 139.63ms. Allocated memory is still 165.7MB. Free memory was 123.4MB in the beginning and 113.8MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1350.08ms. Allocated memory is still 165.7MB. Free memory was 113.8MB in the beginning and 94.6MB in the end (delta: 19.2MB). Peak memory consumption was 74.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11678.51ms. Allocated memory was 165.7MB in the beginning and 356.5MB in the end (delta: 190.8MB). Free memory was 94.6MB in the beginning and 274.7MB in the end (delta: -180.2MB). Peak memory consumption was 139.7MB. Max. memory is 16.1GB. * Witness Printer took 193.48ms. Allocated memory is still 356.5MB. Free memory was 274.7MB in the beginning and 262.1MB in the end (delta: 12.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 158]: 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, 144 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.3s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1174 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1174 mSDsluCounter, 1496 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 58 mSDsCounter, 638 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4873 IncrementalHoareTripleChecker+Invalid, 5511 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 638 mSolverCounterUnsat, 1438 mSDtfsCounter, 4873 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 476 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2088occurred in iteration=12, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 1251 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 3208 NumberOfCodeBlocks, 3208 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3193 ConstructedInterpolants, 0 QuantifiedInterpolants, 9273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 663 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 15 InterpolantComputations, 13 PerfectInterpolantSequences, 2708/2797 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: 592]: Loop Invariant Derived loop invariant: ((((((((a19 <= 9) && (a10 == 4)) && (14 == a4)) && (a12 == 0)) || (((a10 == 0) && (14 == a4)) && (a12 == 0))) || (((((a19 <= 9) && (7 <= a19)) && (14 == a4)) && (a10 == 2)) && (a12 == 0))) || ((((a19 <= 9) && (a10 == 3)) && (14 == a4)) && (a12 == 0))) || ((((7 <= a19) && (a10 == 1)) && (14 == a4)) && (a12 == 0))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:16:15,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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