./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.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 46305506117a7249be58d8d8d8c60453578281c1cbb0dca593851bdc92c5fe11 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:33:31,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:33:31,833 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:33:31,838 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:33:31,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:33:31,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:33:31,857 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:33:31,857 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:33:31,858 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:33:31,858 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:33:31,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:33:31,859 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:33:31,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:33:31,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:33:31,862 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:33:31,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:33:31,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:33:31,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:33:31,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:33:31,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:33:31,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:33:31,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:33:31,873 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:33:31,873 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:33:31,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:33:31,874 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:33:31,874 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:33:31,874 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:33:31,874 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:33:31,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:33:31,875 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:33:31,875 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:33:31,875 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:33:31,875 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:33:31,875 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:33:31,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:33:31,876 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:33:31,876 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:33:31,876 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:33:31,876 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:33:31,877 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:33:31,877 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:33:31,877 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 -> 46305506117a7249be58d8d8d8c60453578281c1cbb0dca593851bdc92c5fe11 [2024-10-10 23:33:32,091 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:33:32,113 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:33:32,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:33:32,117 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:33:32,117 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:33:32,118 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c [2024-10-10 23:33:33,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:33:33,850 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:33:33,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c [2024-10-10 23:33:33,871 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abfa2714d/6633e4b6014444d3926af889f5d415de/FLAG32086644c [2024-10-10 23:33:33,886 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/abfa2714d/6633e4b6014444d3926af889f5d415de [2024-10-10 23:33:33,888 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:33:33,890 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:33:33,892 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:33:33,892 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:33:33,896 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:33:33,897 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:33:33" (1/1) ... [2024-10-10 23:33:33,897 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@409d4792 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:33, skipping insertion in model container [2024-10-10 23:33:33,898 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:33:33" (1/1) ... [2024-10-10 23:33:33,942 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:33:34,191 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c[4533,4546] [2024-10-10 23:33:34,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:33:34,339 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:33:34,372 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label30.c[4533,4546] [2024-10-10 23:33:34,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:33:34,525 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:33:34,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34 WrapperNode [2024-10-10 23:33:34,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:33:34,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:33:34,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:33:34,527 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:33:34,533 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:33:34" (1/1) ... [2024-10-10 23:33:34,547 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:33:34" (1/1) ... [2024-10-10 23:33:34,662 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:33:34,662 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:33:34,663 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:33:34,663 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:33:34,663 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:33:34,679 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,686 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,717 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:33:34,717 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,717 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,735 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,741 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,753 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:33:34,764 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:33:34,764 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:33:34,764 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:33:34,765 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (1/1) ... [2024-10-10 23:33:34,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:33:34,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:34,793 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:33:34,795 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:33:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:33:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:33:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:33:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:33:34,894 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:33:34,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:33:35,882 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:33:35,883 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:33:35,925 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:33:35,927 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:33:35,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:35 BoogieIcfgContainer [2024-10-10 23:33:35,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:33:35,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:33:35,929 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:33:35,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:33:35,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:33:33" (1/3) ... [2024-10-10 23:33:35,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1f8e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:33:35, skipping insertion in model container [2024-10-10 23:33:35,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:33:34" (2/3) ... [2024-10-10 23:33:35,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a1f8e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:33:35, skipping insertion in model container [2024-10-10 23:33:35,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:35" (3/3) ... [2024-10-10 23:33:35,936 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label30.c [2024-10-10 23:33:35,948 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:33:35,949 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:33:36,007 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:33:36,013 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;@6e98213a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:33:36,015 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:33:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 23:33:36,029 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:36,029 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] [2024-10-10 23:33:36,030 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:36,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash 323134465, now seen corresponding path program 1 times [2024-10-10 23:33:36,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:36,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920510787] [2024-10-10 23:33:36,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:36,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:36,194 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:33:36,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:36,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920510787] [2024-10-10 23:33:36,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920510787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:36,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:36,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:36,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234523072] [2024-10-10 23:33:36,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:36,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:33:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:36,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:33:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:33:36,231 INFO L87 Difference]: Start difference. First operand has 183 states, 181 states have (on average 1.988950276243094) internal successors, (360), 182 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:36,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:36,278 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:33:36,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:33:36,280 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-10 23:33:36,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:36,290 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:33:36,290 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:33:36,293 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:33:36,296 INFO L432 NwaCegarLoop]: 295 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:36,297 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 295 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:33:36,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:33:36,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:33:36,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6388888888888888) internal successors, (295), 180 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:33:36,338 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 42 [2024-10-10 23:33:36,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:36,340 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:33:36,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:33:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-10-10 23:33:36,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:36,341 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] [2024-10-10 23:33:36,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:33:36,341 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:36,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:36,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1695351308, now seen corresponding path program 1 times [2024-10-10 23:33:36,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:36,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231607721] [2024-10-10 23:33:36,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:36,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:36,443 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:33:36,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:36,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231607721] [2024-10-10 23:33:36,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231607721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:36,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:36,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:33:36,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965541433] [2024-10-10 23:33:36,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:36,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:36,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:36,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:36,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:36,449 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:37,128 INFO L93 Difference]: Finished difference Result 539 states and 882 transitions. [2024-10-10 23:33:37,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:37,129 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2024-10-10 23:33:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:37,131 INFO L225 Difference]: With dead ends: 539 [2024-10-10 23:33:37,133 INFO L226 Difference]: Without dead ends: 359 [2024-10-10 23:33:37,133 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:33:37,135 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 156 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:37,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 87 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:37,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-10-10 23:33:37,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2024-10-10 23:33:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 1.4217877094972067) internal successors, (509), 358 states have internal predecessors, (509), 0 states have call successors, (0), 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:33:37,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 509 transitions. [2024-10-10 23:33:37,159 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 509 transitions. Word has length 42 [2024-10-10 23:33:37,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:37,159 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 509 transitions. [2024-10-10 23:33:37,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:37,162 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 509 transitions. [2024-10-10 23:33:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-10 23:33:37,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:37,165 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:37,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:33:37,165 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:37,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:37,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1685393444, now seen corresponding path program 1 times [2024-10-10 23:33:37,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:37,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881212817] [2024-10-10 23:33:37,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:37,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:37,421 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:37,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:37,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881212817] [2024-10-10 23:33:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881212817] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:37,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:37,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102137355] [2024-10-10 23:33:37,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:37,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:37,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:37,423 INFO L87 Difference]: Start difference. First operand 359 states and 509 transitions. Second operand has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:38,209 INFO L93 Difference]: Finished difference Result 1073 states and 1445 transitions. [2024-10-10 23:33:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:38,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-10-10 23:33:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:38,212 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:33:38,212 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:33:38,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:38,220 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 418 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 418 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 1017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:38,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [418 Valid, 119 Invalid, 1017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 977 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:33:38,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:33:38,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:33:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.2619047619047619) internal successors, (901), 714 states have internal predecessors, (901), 0 states have call successors, (0), 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:33:38,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 901 transitions. [2024-10-10 23:33:38,269 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 901 transitions. Word has length 121 [2024-10-10 23:33:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:38,269 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 901 transitions. [2024-10-10 23:33:38,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.25) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 901 transitions. [2024-10-10 23:33:38,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-10-10 23:33:38,285 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:38,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:38,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:33:38,291 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:38,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:38,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1395605253, now seen corresponding path program 1 times [2024-10-10 23:33:38,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:38,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925146037] [2024-10-10 23:33:38,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:38,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:38,541 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:38,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:38,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925146037] [2024-10-10 23:33:38,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925146037] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:38,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359493710] [2024-10-10 23:33:38,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:38,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:38,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:38,544 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:33:38,545 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:33:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:38,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:38,640 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 23:33:38,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:38,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359493710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:38,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:38,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 23:33:38,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574749248] [2024-10-10 23:33:38,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:38,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:38,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:38,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:33:38,854 INFO L87 Difference]: Start difference. First operand 715 states and 901 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:39,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:39,388 INFO L93 Difference]: Finished difference Result 1251 states and 1611 transitions. [2024-10-10 23:33:39,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:39,389 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2024-10-10 23:33:39,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:39,392 INFO L225 Difference]: With dead ends: 1251 [2024-10-10 23:33:39,392 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:33:39,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 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:33:39,394 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 91 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:39,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 34 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:39,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:33:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 893. [2024-10-10 23:33:39,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.3374439461883407) internal successors, (1193), 892 states have internal predecessors, (1193), 0 states have call successors, (0), 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:33:39,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1193 transitions. [2024-10-10 23:33:39,413 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1193 transitions. Word has length 147 [2024-10-10 23:33:39,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:39,414 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1193 transitions. [2024-10-10 23:33:39,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:39,414 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1193 transitions. [2024-10-10 23:33:39,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-10-10 23:33:39,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:39,417 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:33:39,432 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:33:39,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:39,618 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:39,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:39,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1085736655, now seen corresponding path program 1 times [2024-10-10 23:33:39,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:39,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696537711] [2024-10-10 23:33:39,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:39,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:39,978 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-10-10 23:33:39,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:39,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696537711] [2024-10-10 23:33:39,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696537711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:39,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:39,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:39,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724418640] [2024-10-10 23:33:39,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:39,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:39,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:39,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:39,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:39,984 INFO L87 Difference]: Start difference. First operand 893 states and 1193 transitions. Second operand has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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:33:40,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:40,627 INFO L93 Difference]: Finished difference Result 1992 states and 2628 transitions. [2024-10-10 23:33:40,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:40,628 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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 201 [2024-10-10 23:33:40,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:40,631 INFO L225 Difference]: With dead ends: 1992 [2024-10-10 23:33:40,631 INFO L226 Difference]: Without dead ends: 1071 [2024-10-10 23:33:40,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:40,633 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 102 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:40,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 118 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:33:40,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-10 23:33:40,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 1071. [2024-10-10 23:33:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1803738317757009) internal successors, (1263), 1070 states have internal predecessors, (1263), 0 states have call successors, (0), 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:33:40,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1263 transitions. [2024-10-10 23:33:40,646 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1263 transitions. Word has length 201 [2024-10-10 23:33:40,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:40,646 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1263 transitions. [2024-10-10 23:33:40,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.5) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 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:33:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1263 transitions. [2024-10-10 23:33:40,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-10-10 23:33:40,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:40,648 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, 2, 2, 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] [2024-10-10 23:33:40,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:33:40,649 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:40,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:40,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1479071179, now seen corresponding path program 1 times [2024-10-10 23:33:40,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:40,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15872296] [2024-10-10 23:33:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:40,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15872296] [2024-10-10 23:33:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15872296] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505539287] [2024-10-10 23:33:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:40,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:40,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:40,864 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:33:40,865 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:33:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:40,990 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:40,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:41,270 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-10-10 23:33:41,272 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:41,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505539287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:41,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:41,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-10-10 23:33:41,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551091337] [2024-10-10 23:33:41,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:41,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:41,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:41,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:41,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:41,276 INFO L87 Difference]: Start difference. First operand 1071 states and 1263 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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:33:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:41,771 INFO L93 Difference]: Finished difference Result 2319 states and 2778 transitions. [2024-10-10 23:33:41,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:41,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 213 [2024-10-10 23:33:41,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:41,775 INFO L225 Difference]: With dead ends: 2319 [2024-10-10 23:33:41,775 INFO L226 Difference]: Without dead ends: 1249 [2024-10-10 23:33:41,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:33:41,777 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 84 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:41,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 45 Invalid, 526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-10-10 23:33:41,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1071. [2024-10-10 23:33:41,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1071 states, 1070 states have (on average 1.1672897196261682) internal successors, (1249), 1070 states have internal predecessors, (1249), 0 states have call successors, (0), 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:33:41,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1071 states to 1071 states and 1249 transitions. [2024-10-10 23:33:41,798 INFO L78 Accepts]: Start accepts. Automaton has 1071 states and 1249 transitions. Word has length 213 [2024-10-10 23:33:41,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:41,799 INFO L471 AbstractCegarLoop]: Abstraction has 1071 states and 1249 transitions. [2024-10-10 23:33:41,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 2 states have internal predecessors, (149), 0 states have call successors, (0), 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:33:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1071 states and 1249 transitions. [2024-10-10 23:33:41,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-10 23:33:41,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:41,801 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:41,814 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:33:42,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:42,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:42,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:42,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1880962322, now seen corresponding path program 1 times [2024-10-10 23:33:42,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:42,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729812272] [2024-10-10 23:33:42,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:42,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:42,172 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:33:42,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:42,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729812272] [2024-10-10 23:33:42,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729812272] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:42,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:42,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:42,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540932293] [2024-10-10 23:33:42,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:42,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:42,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:42,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:42,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:42,174 INFO L87 Difference]: Start difference. First operand 1071 states and 1249 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:33:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:42,593 INFO L93 Difference]: Finished difference Result 2853 states and 3361 transitions. [2024-10-10 23:33:42,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:42,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 216 [2024-10-10 23:33:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:42,598 INFO L225 Difference]: With dead ends: 2853 [2024-10-10 23:33:42,598 INFO L226 Difference]: Without dead ends: 1783 [2024-10-10 23:33:42,599 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:33:42,600 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 111 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:42,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 74 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:42,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2024-10-10 23:33:42,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2024-10-10 23:33:42,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1290684624017957) internal successors, (2012), 1782 states have internal predecessors, (2012), 0 states have call successors, (0), 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:33:42,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2012 transitions. [2024-10-10 23:33:42,659 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2012 transitions. Word has length 216 [2024-10-10 23:33:42,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:42,660 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2012 transitions. [2024-10-10 23:33:42,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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:33:42,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2012 transitions. [2024-10-10 23:33:42,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2024-10-10 23:33:42,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:42,663 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:42,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:33:42,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:42,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:42,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1708818364, now seen corresponding path program 1 times [2024-10-10 23:33:42,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:42,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819126967] [2024-10-10 23:33:42,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:42,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 263 trivial. 0 not checked. [2024-10-10 23:33:42,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:42,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819126967] [2024-10-10 23:33:42,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819126967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:42,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:42,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:42,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040369318] [2024-10-10 23:33:42,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:42,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:33:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:42,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:33:42,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:42,942 INFO L87 Difference]: Start difference. First operand 1783 states and 2012 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:33:43,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:43,419 INFO L93 Difference]: Finished difference Result 3623 states and 4104 transitions. [2024-10-10 23:33:43,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:33:43,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 333 [2024-10-10 23:33:43,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:43,424 INFO L225 Difference]: With dead ends: 3623 [2024-10-10 23:33:43,424 INFO L226 Difference]: Without dead ends: 1961 [2024-10-10 23:33:43,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:33:43,426 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 141 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:43,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 14 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:43,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-10 23:33:43,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-10 23:33:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.084736251402918) internal successors, (1933), 1782 states have internal predecessors, (1933), 0 states have call successors, (0), 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:33:43,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 1933 transitions. [2024-10-10 23:33:43,483 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 1933 transitions. Word has length 333 [2024-10-10 23:33:43,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:43,483 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 1933 transitions. [2024-10-10 23:33:43,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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:33:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 1933 transitions. [2024-10-10 23:33:43,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2024-10-10 23:33:43,489 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:43,489 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2024-10-10 23:33:43,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:33:43,489 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:43,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:43,490 INFO L85 PathProgramCache]: Analyzing trace with hash 969876690, now seen corresponding path program 1 times [2024-10-10 23:33:43,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:43,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567541895] [2024-10-10 23:33:43,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:43,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:43,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:43,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:43,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567541895] [2024-10-10 23:33:43,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567541895] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:43,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:43,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:43,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572292318] [2024-10-10 23:33:43,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:43,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:43,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:43,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:43,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:43,817 INFO L87 Difference]: Start difference. First operand 1783 states and 1933 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:44,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:44,294 INFO L93 Difference]: Finished difference Result 4277 states and 4674 transitions. [2024-10-10 23:33:44,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:44,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 428 [2024-10-10 23:33:44,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:44,304 INFO L225 Difference]: With dead ends: 4277 [2024-10-10 23:33:44,308 INFO L226 Difference]: Without dead ends: 2673 [2024-10-10 23:33:44,314 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:33:44,315 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 110 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:44,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 242 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:44,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2024-10-10 23:33:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2139. [2024-10-10 23:33:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.0720299345182414) internal successors, (2292), 2138 states have internal predecessors, (2292), 0 states have call successors, (0), 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:33:44,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2292 transitions. [2024-10-10 23:33:44,344 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2292 transitions. Word has length 428 [2024-10-10 23:33:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:44,345 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2292 transitions. [2024-10-10 23:33:44,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:33:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2292 transitions. [2024-10-10 23:33:44,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2024-10-10 23:33:44,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:44,350 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:44,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:33:44,350 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:44,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:44,350 INFO L85 PathProgramCache]: Analyzing trace with hash -2073743133, now seen corresponding path program 1 times [2024-10-10 23:33:44,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:44,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497733729] [2024-10-10 23:33:44,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:44,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:44,697 INFO L134 CoverageAnalysis]: Checked inductivity of 683 backedges. 369 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:44,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:44,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497733729] [2024-10-10 23:33:44,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497733729] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:44,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:44,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:44,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094359480] [2024-10-10 23:33:44,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:44,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:44,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:44,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:44,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:44,700 INFO L87 Difference]: Start difference. First operand 2139 states and 2292 transitions. Second operand has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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:33:45,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:45,157 INFO L93 Difference]: Finished difference Result 4811 states and 5227 transitions. [2024-10-10 23:33:45,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:45,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 435 [2024-10-10 23:33:45,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:45,164 INFO L225 Difference]: With dead ends: 4811 [2024-10-10 23:33:45,164 INFO L226 Difference]: Without dead ends: 2851 [2024-10-10 23:33:45,166 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:33:45,167 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 113 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:45,167 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 199 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:45,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2024-10-10 23:33:45,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2851. [2024-10-10 23:33:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2850 states have (on average 1.07859649122807) internal successors, (3074), 2850 states have internal predecessors, (3074), 0 states have call successors, (0), 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:33:45,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 3074 transitions. [2024-10-10 23:33:45,238 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 3074 transitions. Word has length 435 [2024-10-10 23:33:45,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:45,239 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 3074 transitions. [2024-10-10 23:33:45,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.66666666666667) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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:33:45,239 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 3074 transitions. [2024-10-10 23:33:45,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2024-10-10 23:33:45,241 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:45,241 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:45,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:33:45,241 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:45,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:45,242 INFO L85 PathProgramCache]: Analyzing trace with hash -1704666510, now seen corresponding path program 1 times [2024-10-10 23:33:45,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:45,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247637998] [2024-10-10 23:33:45,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:45,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:45,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:45,495 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 483 proven. 0 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2024-10-10 23:33:45,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:45,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247637998] [2024-10-10 23:33:45,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247637998] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:45,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:33:45,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:33:45,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945816878] [2024-10-10 23:33:45,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:45,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:45,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:45,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:45,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:33:45,496 INFO L87 Difference]: Start difference. First operand 2851 states and 3074 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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:33:46,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:46,006 INFO L93 Difference]: Finished difference Result 6591 states and 7211 transitions. [2024-10-10 23:33:46,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:46,007 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 476 [2024-10-10 23:33:46,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:46,022 INFO L225 Difference]: With dead ends: 6591 [2024-10-10 23:33:46,022 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:33:46,029 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:33:46,030 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:46,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 50 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:33:46,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:33:46,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3563. [2024-10-10 23:33:46,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3563 states, 3562 states have (on average 1.0783267827063447) internal successors, (3841), 3562 states have internal predecessors, (3841), 0 states have call successors, (0), 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:33:46,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3563 states to 3563 states and 3841 transitions. [2024-10-10 23:33:46,176 INFO L78 Accepts]: Start accepts. Automaton has 3563 states and 3841 transitions. Word has length 476 [2024-10-10 23:33:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:46,177 INFO L471 AbstractCegarLoop]: Abstraction has 3563 states and 3841 transitions. [2024-10-10 23:33:46,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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:33:46,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3563 states and 3841 transitions. [2024-10-10 23:33:46,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 622 [2024-10-10 23:33:46,185 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:46,185 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:46,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 23:33:46,189 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:46,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:46,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1040568906, now seen corresponding path program 1 times [2024-10-10 23:33:46,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:46,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60373446] [2024-10-10 23:33:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:46,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:46,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 1074 proven. 104 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-10 23:33:46,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60373446] [2024-10-10 23:33:46,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60373446] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:46,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391791798] [2024-10-10 23:33:46,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:46,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:46,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:46,955 INFO L229 MonitoredProcess]: Starting monitored process 4 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:33:46,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 23:33:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:47,113 INFO L255 TraceCheckSpWp]: Trace formula consists of 797 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:47,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:47,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1288 trivial. 0 not checked. [2024-10-10 23:33:47,187 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:47,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391791798] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:47,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:47,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:47,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305993253] [2024-10-10 23:33:47,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:47,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:47,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:47,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:47,189 INFO L87 Difference]: Start difference. First operand 3563 states and 3841 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:33:47,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:47,594 INFO L93 Difference]: Finished difference Result 8015 states and 8684 transitions. [2024-10-10 23:33:47,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:47,594 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 621 [2024-10-10 23:33:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:47,604 INFO L225 Difference]: With dead ends: 8015 [2024-10-10 23:33:47,604 INFO L226 Difference]: Without dead ends: 4631 [2024-10-10 23:33:47,607 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 620 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:47,607 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 138 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:47,608 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 244 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4631 states. [2024-10-10 23:33:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4631 to 4453. [2024-10-10 23:33:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0721024258760108) internal successors, (4773), 4452 states have internal predecessors, (4773), 0 states have call successors, (0), 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:33:47,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4773 transitions. [2024-10-10 23:33:47,660 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4773 transitions. Word has length 621 [2024-10-10 23:33:47,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:47,661 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4773 transitions. [2024-10-10 23:33:47,661 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:33:47,661 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4773 transitions. [2024-10-10 23:33:47,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2024-10-10 23:33:47,689 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:47,690 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:47,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 23:33:47,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:47,891 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:47,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:47,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1555445144, now seen corresponding path program 1 times [2024-10-10 23:33:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:47,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664537447] [2024-10-10 23:33:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:48,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 1129 proven. 104 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-10 23:33:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664537447] [2024-10-10 23:33:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664537447] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:48,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431304678] [2024-10-10 23:33:48,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:48,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:48,469 INFO L229 MonitoredProcess]: Starting monitored process 5 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:33:48,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 23:33:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:48,605 INFO L255 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:48,610 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1588 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-10-10 23:33:48,657 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:48,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431304678] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:48,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130623744] [2024-10-10 23:33:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:48,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:48,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:48,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:48,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:48,659 INFO L87 Difference]: Start difference. First operand 4453 states and 4773 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:33:49,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:49,035 INFO L93 Difference]: Finished difference Result 5345 states and 5725 transitions. [2024-10-10 23:33:49,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:49,036 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 633 [2024-10-10 23:33:49,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:49,047 INFO L225 Difference]: With dead ends: 5345 [2024-10-10 23:33:49,047 INFO L226 Difference]: Without dead ends: 5343 [2024-10-10 23:33:49,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 632 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:49,049 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 158 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:49,049 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 9 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:49,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5343 states. [2024-10-10 23:33:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5343 to 4453. [2024-10-10 23:33:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0718778077268643) internal successors, (4772), 4452 states have internal predecessors, (4772), 0 states have call successors, (0), 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:33:49,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4772 transitions. [2024-10-10 23:33:49,097 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4772 transitions. Word has length 633 [2024-10-10 23:33:49,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:49,098 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4772 transitions. [2024-10-10 23:33:49,098 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:33:49,098 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4772 transitions. [2024-10-10 23:33:49,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2024-10-10 23:33:49,102 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:49,103 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:49,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 23:33:49,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 23:33:49,308 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:49,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:49,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1186239876, now seen corresponding path program 1 times [2024-10-10 23:33:49,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115238094] [2024-10-10 23:33:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:49,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 1161 proven. 104 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-10 23:33:49,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115238094] [2024-10-10 23:33:49,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115238094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:49,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553590769] [2024-10-10 23:33:49,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:49,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:49,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:49,803 INFO L229 MonitoredProcess]: Starting monitored process 6 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:33:49,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-10 23:33:49,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:49,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 817 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:49,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:50,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2024-10-10 23:33:50,058 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:50,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553590769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:50,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:50,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:50,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216957754] [2024-10-10 23:33:50,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:50,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:50,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:50,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:50,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:50,061 INFO L87 Difference]: Start difference. First operand 4453 states and 4772 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:33:50,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:50,480 INFO L93 Difference]: Finished difference Result 8727 states and 9364 transitions. [2024-10-10 23:33:50,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:50,481 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 641 [2024-10-10 23:33:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:50,497 INFO L225 Difference]: With dead ends: 8727 [2024-10-10 23:33:50,497 INFO L226 Difference]: Without dead ends: 4453 [2024-10-10 23:33:50,508 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 645 GetRequests, 640 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:33:50,511 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 141 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:50,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 188 Invalid, 482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:33:50,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4453 states. [2024-10-10 23:33:50,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4453 to 3919. [2024-10-10 23:33:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3919 states, 3918 states have (on average 1.0704441041347625) internal successors, (4194), 3918 states have internal predecessors, (4194), 0 states have call successors, (0), 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:33:50,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3919 states to 3919 states and 4194 transitions. [2024-10-10 23:33:50,604 INFO L78 Accepts]: Start accepts. Automaton has 3919 states and 4194 transitions. Word has length 641 [2024-10-10 23:33:50,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:50,604 INFO L471 AbstractCegarLoop]: Abstraction has 3919 states and 4194 transitions. [2024-10-10 23:33:50,605 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:33:50,605 INFO L276 IsEmpty]: Start isEmpty. Operand 3919 states and 4194 transitions. [2024-10-10 23:33:50,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2024-10-10 23:33:50,613 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:33:50,613 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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] [2024-10-10 23:33:50,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 23:33:50,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:33:50,816 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:33:50,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:33:50,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1887705839, now seen corresponding path program 1 times [2024-10-10 23:33:50,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:33:50,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753319707] [2024-10-10 23:33:50,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:50,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:33:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:51,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 1233 proven. 104 refuted. 0 times theorem prover too weak. 355 trivial. 0 not checked. [2024-10-10 23:33:51,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:33:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753319707] [2024-10-10 23:33:51,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753319707] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:33:51,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1659298179] [2024-10-10 23:33:51,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:33:51,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:33:51,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:33:51,462 INFO L229 MonitoredProcess]: Starting monitored process 7 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:33:51,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-10 23:33:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:33:51,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 878 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:33:51,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:33:51,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1692 backedges. 245 proven. 0 refuted. 0 times theorem prover too weak. 1447 trivial. 0 not checked. [2024-10-10 23:33:51,691 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:33:51,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1659298179] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:33:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:33:51,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:33:51,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729819258] [2024-10-10 23:33:51,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:33:51,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:33:51,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:33:51,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:33:51,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:51,693 INFO L87 Difference]: Start difference. First operand 3919 states and 4194 transitions. Second operand has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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:33:52,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:33:52,032 INFO L93 Difference]: Finished difference Result 8547 states and 9151 transitions. [2024-10-10 23:33:52,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:33:52,033 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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 700 [2024-10-10 23:33:52,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:33:52,034 INFO L225 Difference]: With dead ends: 8547 [2024-10-10 23:33:52,034 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:33:52,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 699 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:33:52,039 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 138 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:33:52,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 241 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:33:52,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:33:52,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:33:52,039 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:33:52,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:33:52,040 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 700 [2024-10-10 23:33:52,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:33:52,040 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:33:52,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.66666666666667) internal successors, (197), 3 states have internal predecessors, (197), 0 states have call successors, (0), 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:33:52,040 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:33:52,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:33:52,042 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:33:52,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-10 23:33:52,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-10 23:33:52,246 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:33:52,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:33:52,625 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:33:52,656 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:33:52 BoogieIcfgContainer [2024-10-10 23:33:52,660 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:33:52,661 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:33:52,661 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:33:52,661 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:33:52,661 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:33:35" (3/4) ... [2024-10-10 23:33:52,663 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:33:52,684 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:33:52,684 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:33:52,690 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:33:52,691 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:33:52,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:33:52,955 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:33:52,955 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:33:52,956 INFO L158 Benchmark]: Toolchain (without parser) took 19066.39ms. Allocated memory was 174.1MB in the beginning and 824.2MB in the end (delta: 650.1MB). Free memory was 115.8MB in the beginning and 437.7MB in the end (delta: -321.9MB). Peak memory consumption was 329.6MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,956 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:33:52,956 INFO L158 Benchmark]: CACSL2BoogieTranslator took 634.67ms. Allocated memory is still 174.1MB. Free memory was 115.6MB in the beginning and 80.7MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,956 INFO L158 Benchmark]: Boogie Procedure Inliner took 135.68ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 80.7MB in the beginning and 217.5MB in the end (delta: -136.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,957 INFO L158 Benchmark]: Boogie Preprocessor took 100.02ms. Allocated memory is still 253.8MB. Free memory was 217.5MB in the beginning and 205.2MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,957 INFO L158 Benchmark]: RCFGBuilder took 1164.13ms. Allocated memory is still 253.8MB. Free memory was 205.2MB in the beginning and 180.8MB in the end (delta: 24.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,957 INFO L158 Benchmark]: TraceAbstraction took 16731.22ms. Allocated memory was 253.8MB in the beginning and 824.2MB in the end (delta: 570.4MB). Free memory was 180.8MB in the beginning and 452.4MB in the end (delta: -271.5MB). Peak memory consumption was 301.0MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,957 INFO L158 Benchmark]: Witness Printer took 294.93ms. Allocated memory is still 824.2MB. Free memory was 451.3MB in the beginning and 437.7MB in the end (delta: 13.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:33:52,964 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.14ms. Allocated memory is still 174.1MB. Free memory is still 142.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 634.67ms. Allocated memory is still 174.1MB. Free memory was 115.6MB in the beginning and 80.7MB in the end (delta: 34.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 135.68ms. Allocated memory was 174.1MB in the beginning and 253.8MB in the end (delta: 79.7MB). Free memory was 80.7MB in the beginning and 217.5MB in the end (delta: -136.8MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 100.02ms. Allocated memory is still 253.8MB. Free memory was 217.5MB in the beginning and 205.2MB in the end (delta: 12.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1164.13ms. Allocated memory is still 253.8MB. Free memory was 205.2MB in the beginning and 180.8MB in the end (delta: 24.4MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. * TraceAbstraction took 16731.22ms. Allocated memory was 253.8MB in the beginning and 824.2MB in the end (delta: 570.4MB). Free memory was 180.8MB in the beginning and 452.4MB in the end (delta: -271.5MB). Peak memory consumption was 301.0MB. Max. memory is 16.1GB. * Witness Printer took 294.93ms. Allocated memory is still 824.2MB. Free memory was 451.3MB in the beginning and 437.7MB in the end (delta: 13.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: 143]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 183 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 15, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1972 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1972 mSDsluCounter, 1959 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 826 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7272 IncrementalHoareTripleChecker+Invalid, 8098 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 826 mSolverCounterUnsat, 1892 mSDtfsCounter, 7272 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3002 GetRequests, 2963 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4453occurred in iteration=12, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 3204 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 8204 NumberOfCodeBlocks, 8204 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 8183 ConstructedInterpolants, 0 QuantifiedInterpolants, 33241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3829 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 21 InterpolantComputations, 15 PerfectInterpolantSequences, 15613/16134 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((((7 <= a15) && (a24 == 1)) && (7 == a21)) && (a15 <= 8)) || ((a24 == 1) && (8 <= a21))) || (((a24 == 1) && (a21 <= 6)) && (a15 <= 5))) || ((((7 <= a15) && (a15 <= 8)) && (((long long) 49 + a12) <= 0)) && (10 <= a21))) || (((a24 == 1) && (0 <= ((long long) a12 + 42))) && (8 <= a15))) || (((a24 == 1) && (0 <= ((long long) a12 + 42))) && (a15 <= 5))) || (((a24 == 1) && (a21 <= 6)) && (0 <= ((long long) a12 + 42)))) || ((((7 <= a15) && (a24 == 1)) && (a15 <= 8)) && (((long long) 49 + a12) <= 0))) || (((a21 <= 6) && (((long long) 49 + a12) <= 0)) && (a15 <= 5))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:33:53,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE