./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_label53.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_label53.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 f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:34:43,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:34:43,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 23:34:43,076 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:34:43,076 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:34:43,106 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:34:43,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:34:43,107 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:34:43,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:34:43,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:34:43,108 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:34:43,108 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:34:43,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:34:43,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:34:43,109 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:34:43,110 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:34:43,110 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:34:43,110 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:34:43,110 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:34:43,111 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:34:43,111 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:34:43,111 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:34:43,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:34:43,112 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:34:43,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:34:43,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:34:43,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:34:43,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:34:43,113 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:34:43,113 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:34:43,113 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:34:43,114 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:34:43,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:34:43,114 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:34:43,114 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:34:43,115 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:34:43,115 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:34:43,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:34:43,115 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:34:43,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:34:43,116 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:34:43,116 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:34:43,116 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 -> f09951f8169d75602552a0c69d410baacae8493e4742c50eb18d4008647dffd9 [2024-10-10 23:34:43,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:34:43,347 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:34:43,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:34:43,351 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:34:43,351 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:34:43,353 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2024-10-10 23:34:44,632 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:34:44,869 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:34:44,869 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem14_label53.c [2024-10-10 23:34:44,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a5f11ba4/c720581386d94c40ac18afda489762ab/FLAGc2d403186 [2024-10-10 23:34:45,228 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/3a5f11ba4/c720581386d94c40ac18afda489762ab [2024-10-10 23:34:45,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:34:45,231 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:34:45,235 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:34:45,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:34:45,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:34:45,240 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67a7f9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45, skipping insertion in model container [2024-10-10 23:34:45,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,284 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:34:45,467 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_label53.c[5103,5116] [2024-10-10 23:34:45,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:34:45,644 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:34:45,667 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_label53.c[5103,5116] [2024-10-10 23:34:45,765 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:34:45,780 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:34:45,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45 WrapperNode [2024-10-10 23:34:45,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:34:45,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:34:45,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:34:45,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:34:45,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,877 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 859 [2024-10-10 23:34:45,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:34:45,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:34:45,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:34:45,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:34:45,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,898 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,937 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 23:34:45,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,957 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,962 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,967 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,978 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:34:45,979 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:34:45,979 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:34:45,979 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:34:45,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (1/1) ... [2024-10-10 23:34:45,984 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:34:45,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:46,007 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 23:34:46,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 23:34:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:34:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:34:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:34:46,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:34:46,099 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:34:46,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:34:46,988 INFO L? ?]: Removed 123 outVars from TransFormulas that were not future-live. [2024-10-10 23:34:46,988 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:34:47,036 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:34:47,037 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:34:47,037 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:34:47 BoogieIcfgContainer [2024-10-10 23:34:47,037 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:34:47,038 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:34:47,038 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:34:47,044 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:34:47,044 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:34:45" (1/3) ... [2024-10-10 23:34:47,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784f2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:34:47, skipping insertion in model container [2024-10-10 23:34:47,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:34:45" (2/3) ... [2024-10-10 23:34:47,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@784f2918 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:34:47, skipping insertion in model container [2024-10-10 23:34:47,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:34:47" (3/3) ... [2024-10-10 23:34:47,046 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem14_label53.c [2024-10-10 23:34:47,061 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:34:47,062 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:34:47,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:34:47,129 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;@2a6e472f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:34:47,129 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:34:47,133 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:34:47,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 23:34:47,138 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:47,139 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:47,139 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:47,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:47,143 INFO L85 PathProgramCache]: Analyzing trace with hash -892209182, now seen corresponding path program 1 times [2024-10-10 23:34:47,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:47,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600596117] [2024-10-10 23:34:47,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:47,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:47,300 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:34:47,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:47,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600596117] [2024-10-10 23:34:47,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600596117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:47,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:47,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:34:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580172324] [2024-10-10 23:34:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:47,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:34:47,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:47,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:34:47,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:34:47,347 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 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:34:47,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:47,391 INFO L93 Difference]: Finished difference Result 365 states and 719 transitions. [2024-10-10 23:34:47,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:34:47,394 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-10 23:34:47,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:47,403 INFO L225 Difference]: With dead ends: 365 [2024-10-10 23:34:47,404 INFO L226 Difference]: Without dead ends: 181 [2024-10-10 23:34:47,407 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:34:47,410 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:34:47,410 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:34:47,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-10-10 23:34:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-10-10 23:34:47,450 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:34:47,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 295 transitions. [2024-10-10 23:34:47,455 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 295 transitions. Word has length 48 [2024-10-10 23:34:47,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:47,456 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 295 transitions. [2024-10-10 23:34:47,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 0 states have call successors, (0), 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:34:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 295 transitions. [2024-10-10 23:34:47,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-10-10 23:34:47,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:47,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:47,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:34:47,457 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:47,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:47,458 INFO L85 PathProgramCache]: Analyzing trace with hash -297844156, now seen corresponding path program 1 times [2024-10-10 23:34:47,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:47,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337881869] [2024-10-10 23:34:47,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:47,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:47,715 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:34:47,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:47,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337881869] [2024-10-10 23:34:47,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337881869] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:47,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:47,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:47,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008643585] [2024-10-10 23:34:47,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:47,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:47,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:47,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:47,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:47,720 INFO L87 Difference]: Start difference. First operand 181 states and 295 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:34:48,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:48,685 INFO L93 Difference]: Finished difference Result 717 states and 1175 transitions. [2024-10-10 23:34:48,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:48,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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 48 [2024-10-10 23:34:48,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:48,689 INFO L225 Difference]: With dead ends: 717 [2024-10-10 23:34:48,689 INFO L226 Difference]: Without dead ends: 537 [2024-10-10 23:34:48,690 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:34:48,691 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 481 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 301 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 1067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 301 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:48,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 14 Invalid, 1067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [301 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:34:48,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2024-10-10 23:34:48,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2024-10-10 23:34:48,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 536 states have internal predecessors, (777), 0 states have call successors, (0), 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:34:48,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 777 transitions. [2024-10-10 23:34:48,718 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 777 transitions. Word has length 48 [2024-10-10 23:34:48,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:48,718 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 777 transitions. [2024-10-10 23:34:48,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 3 states have internal predecessors, (48), 0 states have call successors, (0), 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:34:48,718 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 777 transitions. [2024-10-10 23:34:48,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-10-10 23:34:48,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:48,724 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:34:48,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:34:48,724 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:48,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:48,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1696082572, now seen corresponding path program 1 times [2024-10-10 23:34:48,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:48,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939718952] [2024-10-10 23:34:48,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:48,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:48,916 INFO L134 CoverageAnalysis]: Checked inductivity of 158 backedges. 111 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-10-10 23:34:48,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:48,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939718952] [2024-10-10 23:34:48,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939718952] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:48,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:48,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:34:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744460093] [2024-10-10 23:34:48,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:48,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:48,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:48,919 INFO L87 Difference]: Start difference. First operand 537 states and 777 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:34:49,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:49,682 INFO L93 Difference]: Finished difference Result 1073 states and 1655 transitions. [2024-10-10 23:34:49,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:49,683 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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 196 [2024-10-10 23:34:49,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:49,685 INFO L225 Difference]: With dead ends: 1073 [2024-10-10 23:34:49,685 INFO L226 Difference]: Without dead ends: 715 [2024-10-10 23:34:49,687 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:34:49,687 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 125 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:49,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 55 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:34:49,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-10 23:34:49,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2024-10-10 23:34:49,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.354341736694678) internal successors, (967), 714 states have internal predecessors, (967), 0 states have call successors, (0), 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:34:49,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 967 transitions. [2024-10-10 23:34:49,706 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 967 transitions. Word has length 196 [2024-10-10 23:34:49,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:49,706 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 967 transitions. [2024-10-10 23:34:49,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 2 states have internal predecessors, (150), 0 states have call successors, (0), 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:34:49,707 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 967 transitions. [2024-10-10 23:34:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2024-10-10 23:34:49,713 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:49,713 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:49,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:34:49,714 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash -102788281, now seen corresponding path program 1 times [2024-10-10 23:34:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:49,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748451384] [2024-10-10 23:34:49,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:49,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:49,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:49,973 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-10 23:34:49,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:49,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748451384] [2024-10-10 23:34:49,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748451384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:49,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:49,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218533846] [2024-10-10 23:34:49,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:49,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:49,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:49,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:49,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:49,976 INFO L87 Difference]: Start difference. First operand 715 states and 967 transitions. Second operand has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:34:50,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:50,619 INFO L93 Difference]: Finished difference Result 1636 states and 2267 transitions. [2024-10-10 23:34:50,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:50,620 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 219 [2024-10-10 23:34:50,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:50,623 INFO L225 Difference]: With dead ends: 1636 [2024-10-10 23:34:50,623 INFO L226 Difference]: Without dead ends: 1071 [2024-10-10 23:34:50,624 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:34:50,625 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 110 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:50,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 110 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:34:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-10-10 23:34:50,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 893. [2024-10-10 23:34:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 893 states, 892 states have (on average 1.1726457399103138) internal successors, (1046), 892 states have internal predecessors, (1046), 0 states have call successors, (0), 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:34:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 893 states to 893 states and 1046 transitions. [2024-10-10 23:34:50,639 INFO L78 Accepts]: Start accepts. Automaton has 893 states and 1046 transitions. Word has length 219 [2024-10-10 23:34:50,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:50,640 INFO L471 AbstractCegarLoop]: Abstraction has 893 states and 1046 transitions. [2024-10-10 23:34:50,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.5) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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:34:50,640 INFO L276 IsEmpty]: Start isEmpty. Operand 893 states and 1046 transitions. [2024-10-10 23:34:50,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-10-10 23:34:50,645 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:50,645 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:34:50,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:34:50,645 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:50,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:50,646 INFO L85 PathProgramCache]: Analyzing trace with hash 583259477, now seen corresponding path program 1 times [2024-10-10 23:34:50,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:50,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50032417] [2024-10-10 23:34:50,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:50,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:51,219 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 204 proven. 130 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2024-10-10 23:34:51,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50032417] [2024-10-10 23:34:51,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50032417] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:51,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046863164] [2024-10-10 23:34:51,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:51,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:51,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:51,224 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:34:51,226 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:34:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:51,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:34:51,347 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:51,422 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2024-10-10 23:34:51,422 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:51,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046863164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:51,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:51,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:34:51,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669230490] [2024-10-10 23:34:51,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:51,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:51,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:51,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:51,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:51,424 INFO L87 Difference]: Start difference. First operand 893 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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:34:51,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:51,875 INFO L93 Difference]: Finished difference Result 2319 states and 2777 transitions. [2024-10-10 23:34:51,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:51,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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 350 [2024-10-10 23:34:51,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:51,880 INFO L225 Difference]: With dead ends: 2319 [2024-10-10 23:34:51,881 INFO L226 Difference]: Without dead ends: 1605 [2024-10-10 23:34:51,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 349 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:51,882 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 132 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:51,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 262 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:51,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2024-10-10 23:34:51,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 1427. [2024-10-10 23:34:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1426 states have (on average 1.1402524544179524) internal successors, (1626), 1426 states have internal predecessors, (1626), 0 states have call successors, (0), 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:34:51,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1626 transitions. [2024-10-10 23:34:51,899 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1626 transitions. Word has length 350 [2024-10-10 23:34:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:51,900 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1626 transitions. [2024-10-10 23:34:51,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 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:34:51,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1626 transitions. [2024-10-10 23:34:51,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2024-10-10 23:34:51,905 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:51,905 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, 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, 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] [2024-10-10 23:34:51,919 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:34:52,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:52,106 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:52,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:52,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1694679334, now seen corresponding path program 1 times [2024-10-10 23:34:52,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:52,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302876147] [2024-10-10 23:34:52,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:52,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:52,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:52,496 INFO L134 CoverageAnalysis]: Checked inductivity of 746 backedges. 595 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2024-10-10 23:34:52,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:52,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302876147] [2024-10-10 23:34:52,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302876147] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:52,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:52,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:52,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424934839] [2024-10-10 23:34:52,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:52,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:52,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:52,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:52,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:52,498 INFO L87 Difference]: Start difference. First operand 1427 states and 1626 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:34:52,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:52,938 INFO L93 Difference]: Finished difference Result 3209 states and 3756 transitions. [2024-10-10 23:34:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:52,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 449 [2024-10-10 23:34:52,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:52,944 INFO L225 Difference]: With dead ends: 3209 [2024-10-10 23:34:52,944 INFO L226 Difference]: Without dead ends: 1961 [2024-10-10 23:34:52,946 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:34:52,947 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 71 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 75 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:34:52,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 75 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 470 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:52,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1961 states. [2024-10-10 23:34:52,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1961 to 1783. [2024-10-10 23:34:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1782 states have (on average 1.1341189674523007) internal successors, (2021), 1782 states have internal predecessors, (2021), 0 states have call successors, (0), 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:34:52,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2021 transitions. [2024-10-10 23:34:52,970 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2021 transitions. Word has length 449 [2024-10-10 23:34:52,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:52,970 INFO L471 AbstractCegarLoop]: Abstraction has 1783 states and 2021 transitions. [2024-10-10 23:34:52,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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:34:52,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2021 transitions. [2024-10-10 23:34:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2024-10-10 23:34:52,975 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:52,975 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, 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, 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, 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:34:52,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:34:52,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:52,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:52,976 INFO L85 PathProgramCache]: Analyzing trace with hash -314600810, now seen corresponding path program 1 times [2024-10-10 23:34:52,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:52,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003498868] [2024-10-10 23:34:52,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:52,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:53,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 750 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-10-10 23:34:53,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:53,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003498868] [2024-10-10 23:34:53,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003498868] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:53,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:53,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:53,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070963340] [2024-10-10 23:34:53,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:53,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:53,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:53,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:53,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:53,613 INFO L87 Difference]: Start difference. First operand 1783 states and 2021 transitions. Second operand has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:34:54,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:54,319 INFO L93 Difference]: Finished difference Result 3743 states and 4237 transitions. [2024-10-10 23:34:54,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:54,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 473 [2024-10-10 23:34:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:54,325 INFO L225 Difference]: With dead ends: 3743 [2024-10-10 23:34:54,325 INFO L226 Difference]: Without dead ends: 2139 [2024-10-10 23:34:54,327 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:34:54,329 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 124 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:54,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 88 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:34:54,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2024-10-10 23:34:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2139. [2024-10-10 23:34:54,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.117867165575304) internal successors, (2390), 2138 states have internal predecessors, (2390), 0 states have call successors, (0), 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:34:54,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2390 transitions. [2024-10-10 23:34:54,357 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2390 transitions. Word has length 473 [2024-10-10 23:34:54,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:54,358 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2390 transitions. [2024-10-10 23:34:54,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.5) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 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:34:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2390 transitions. [2024-10-10 23:34:54,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2024-10-10 23:34:54,364 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:54,364 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:54,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:34:54,365 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:54,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:54,366 INFO L85 PathProgramCache]: Analyzing trace with hash 159748493, now seen corresponding path program 1 times [2024-10-10 23:34:54,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:54,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858229876] [2024-10-10 23:34:54,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:54,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:54,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1112 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-10-10 23:34:54,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:54,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858229876] [2024-10-10 23:34:54,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858229876] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:54,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:54,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:54,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37574759] [2024-10-10 23:34:54,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:54,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:54,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:54,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:54,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:34:54,685 INFO L87 Difference]: Start difference. First operand 2139 states and 2390 transitions. Second operand has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:34:55,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:55,162 INFO L93 Difference]: Finished difference Result 4335 states and 4848 transitions. [2024-10-10 23:34:55,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:55,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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 529 [2024-10-10 23:34:55,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:55,168 INFO L225 Difference]: With dead ends: 4335 [2024-10-10 23:34:55,168 INFO L226 Difference]: Without dead ends: 2317 [2024-10-10 23:34:55,170 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:34:55,171 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 124 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:55,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 14 Invalid, 720 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 687 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:34:55,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-10-10 23:34:55,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 2139. [2024-10-10 23:34:55,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2139 states, 2138 states have (on average 1.0855940130963517) internal successors, (2321), 2138 states have internal predecessors, (2321), 0 states have call successors, (0), 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:34:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2139 states to 2139 states and 2321 transitions. [2024-10-10 23:34:55,198 INFO L78 Accepts]: Start accepts. Automaton has 2139 states and 2321 transitions. Word has length 529 [2024-10-10 23:34:55,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:55,198 INFO L471 AbstractCegarLoop]: Abstraction has 2139 states and 2321 transitions. [2024-10-10 23:34:55,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.25) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 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:34:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2139 states and 2321 transitions. [2024-10-10 23:34:55,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2024-10-10 23:34:55,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:55,205 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:34:55,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:34:55,206 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:55,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1459761138, now seen corresponding path program 2 times [2024-10-10 23:34:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985957503] [2024-10-10 23:34:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:55,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 819 proven. 11 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:34:55,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:55,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985957503] [2024-10-10 23:34:55,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985957503] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333022343] [2024-10-10 23:34:55,681 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-10 23:34:55,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:55,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:55,687 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:34:55,690 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:34:55,846 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-10 23:34:55,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-10 23:34:55,849 INFO L255 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:55,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 830 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:34:56,442 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333022343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:34:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722311408] [2024-10-10 23:34:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:56,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:34:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:56,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:34:56,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:56,445 INFO L87 Difference]: Start difference. First operand 2139 states and 2321 transitions. Second operand has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:34:57,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:57,071 INFO L93 Difference]: Finished difference Result 4989 states and 5474 transitions. [2024-10-10 23:34:57,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:34:57,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 555 [2024-10-10 23:34:57,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:57,080 INFO L225 Difference]: With dead ends: 4989 [2024-10-10 23:34:57,080 INFO L226 Difference]: Without dead ends: 3029 [2024-10-10 23:34:57,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 558 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:57,083 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 161 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:57,083 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 13 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:34:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3029 states. [2024-10-10 23:34:57,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3029 to 2495. [2024-10-10 23:34:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2495 states, 2494 states have (on average 1.0789895749799518) internal successors, (2691), 2494 states have internal predecessors, (2691), 0 states have call successors, (0), 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:34:57,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 2691 transitions. [2024-10-10 23:34:57,119 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 2691 transitions. Word has length 555 [2024-10-10 23:34:57,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:57,120 INFO L471 AbstractCegarLoop]: Abstraction has 2495 states and 2691 transitions. [2024-10-10 23:34:57,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.25) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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:34:57,120 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 2691 transitions. [2024-10-10 23:34:57,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2024-10-10 23:34:57,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:57,124 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2024-10-10 23:34:57,137 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:34:57,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:57,325 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:57,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:57,325 INFO L85 PathProgramCache]: Analyzing trace with hash 388047133, now seen corresponding path program 1 times [2024-10-10 23:34:57,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:57,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490063135] [2024-10-10 23:34:57,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:57,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:57,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 832 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:34:57,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:57,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490063135] [2024-10-10 23:34:57,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490063135] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:57,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:34:57,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:34:57,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275669789] [2024-10-10 23:34:57,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:57,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:57,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:57,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:57,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:34:57,681 INFO L87 Difference]: Start difference. First operand 2495 states and 2691 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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:34:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:34:58,450 INFO L93 Difference]: Finished difference Result 5701 states and 6215 transitions. [2024-10-10 23:34:58,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:34:58,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 562 [2024-10-10 23:34:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:34:58,460 INFO L225 Difference]: With dead ends: 5701 [2024-10-10 23:34:58,460 INFO L226 Difference]: Without dead ends: 3385 [2024-10-10 23:34:58,463 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:34:58,463 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:34:58,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 200 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:34:58,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3385 states. [2024-10-10 23:34:58,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3385 to 3207. [2024-10-10 23:34:58,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3207 states, 3206 states have (on average 1.0770430442919525) internal successors, (3453), 3206 states have internal predecessors, (3453), 0 states have call successors, (0), 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:34:58,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3207 states to 3207 states and 3453 transitions. [2024-10-10 23:34:58,523 INFO L78 Accepts]: Start accepts. Automaton has 3207 states and 3453 transitions. Word has length 562 [2024-10-10 23:34:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:34:58,524 INFO L471 AbstractCegarLoop]: Abstraction has 3207 states and 3453 transitions. [2024-10-10 23:34:58,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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:34:58,524 INFO L276 IsEmpty]: Start isEmpty. Operand 3207 states and 3453 transitions. [2024-10-10 23:34:58,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2024-10-10 23:34:58,528 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:34:58,529 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:34:58,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-10 23:34:58,529 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:34:58,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:34:58,530 INFO L85 PathProgramCache]: Analyzing trace with hash -253105904, now seen corresponding path program 1 times [2024-10-10 23:34:58,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:34:58,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106721954] [2024-10-10 23:34:58,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:58,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:34:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:59,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 846 proven. 195 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2024-10-10 23:34:59,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:34:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106721954] [2024-10-10 23:34:59,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106721954] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:34:59,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802717173] [2024-10-10 23:34:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:34:59,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:34:59,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:34:59,219 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:34:59,219 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:34:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:34:59,361 INFO L255 TraceCheckSpWp]: Trace formula consists of 763 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:34:59,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:34:59,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1193 backedges. 514 proven. 0 refuted. 0 times theorem prover too weak. 679 trivial. 0 not checked. [2024-10-10 23:34:59,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:34:59,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802717173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:34:59,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:34:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-10-10 23:34:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093718064] [2024-10-10 23:34:59,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:34:59,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:34:59,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:34:59,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:34:59,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:34:59,763 INFO L87 Difference]: Start difference. First operand 3207 states and 3453 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:00,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:00,136 INFO L93 Difference]: Finished difference Result 6947 states and 7480 transitions. [2024-10-10 23:35:00,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:00,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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 607 [2024-10-10 23:35:00,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:00,147 INFO L225 Difference]: With dead ends: 6947 [2024-10-10 23:35:00,147 INFO L226 Difference]: Without dead ends: 3919 [2024-10-10 23:35:00,149 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 611 GetRequests, 606 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:00,150 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 27 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:00,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 48 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:00,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3919 states. [2024-10-10 23:35:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3919 to 3385. [2024-10-10 23:35:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3385 states, 3384 states have (on average 1.0783096926713949) internal successors, (3649), 3384 states have internal predecessors, (3649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3385 states to 3385 states and 3649 transitions. [2024-10-10 23:35:00,189 INFO L78 Accepts]: Start accepts. Automaton has 3385 states and 3649 transitions. Word has length 607 [2024-10-10 23:35:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:00,189 INFO L471 AbstractCegarLoop]: Abstraction has 3385 states and 3649 transitions. [2024-10-10 23:35:00,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:00,190 INFO L276 IsEmpty]: Start isEmpty. Operand 3385 states and 3649 transitions. [2024-10-10 23:35:00,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2024-10-10 23:35:00,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:00,194 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:00,208 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:35:00,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:00,396 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:00,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:00,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1536998468, now seen corresponding path program 1 times [2024-10-10 23:35:00,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:00,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620357960] [2024-10-10 23:35:00,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:00,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:00,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1198 backedges. 837 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:35:00,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:00,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620357960] [2024-10-10 23:35:00,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620357960] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:00,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:00,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:00,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107411049] [2024-10-10 23:35:00,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:00,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:00,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:00,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:00,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:00,612 INFO L87 Difference]: Start difference. First operand 3385 states and 3649 transitions. Second operand has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:01,014 INFO L93 Difference]: Finished difference Result 8015 states and 8716 transitions. [2024-10-10 23:35:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 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 629 [2024-10-10 23:35:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:01,025 INFO L225 Difference]: With dead ends: 8015 [2024-10-10 23:35:01,026 INFO L226 Difference]: Without dead ends: 4809 [2024-10-10 23:35:01,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:35:01,029 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:01,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-10 23:35:01,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2024-10-10 23:35:01,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.072171381031614) internal successors, (5155), 4808 states have internal predecessors, (5155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 5155 transitions. [2024-10-10 23:35:01,079 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 5155 transitions. Word has length 629 [2024-10-10 23:35:01,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:01,080 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 5155 transitions. [2024-10-10 23:35:01,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 5155 transitions. [2024-10-10 23:35:01,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2024-10-10 23:35:01,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:01,108 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 1] [2024-10-10 23:35:01,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 23:35:01,109 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:01,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:01,109 INFO L85 PathProgramCache]: Analyzing trace with hash -736954263, now seen corresponding path program 1 times [2024-10-10 23:35:01,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:01,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321478426] [2024-10-10 23:35:01,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:01,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2084 backedges. 1525 proven. 0 refuted. 0 times theorem prover too weak. 559 trivial. 0 not checked. [2024-10-10 23:35:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:01,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321478426] [2024-10-10 23:35:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321478426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:01,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823025635] [2024-10-10 23:35:01,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:01,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:01,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:01,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:01,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:01,492 INFO L87 Difference]: Start difference. First operand 4809 states and 5155 transitions. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:02,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:02,239 INFO L93 Difference]: Finished difference Result 9617 states and 10324 transitions. [2024-10-10 23:35:02,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:02,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 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 708 [2024-10-10 23:35:02,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:02,269 INFO L225 Difference]: With dead ends: 9617 [2024-10-10 23:35:02,272 INFO L226 Difference]: Without dead ends: 4987 [2024-10-10 23:35:02,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:02,278 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 102 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:02,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 240 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:35:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-10 23:35:02,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4453. [2024-10-10 23:35:02,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4453 states, 4452 states have (on average 1.0700808625336926) internal successors, (4764), 4452 states have internal predecessors, (4764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:02,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4453 states to 4453 states and 4764 transitions. [2024-10-10 23:35:02,335 INFO L78 Accepts]: Start accepts. Automaton has 4453 states and 4764 transitions. Word has length 708 [2024-10-10 23:35:02,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:02,335 INFO L471 AbstractCegarLoop]: Abstraction has 4453 states and 4764 transitions. [2024-10-10 23:35:02,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:02,339 INFO L276 IsEmpty]: Start isEmpty. Operand 4453 states and 4764 transitions. [2024-10-10 23:35:02,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 785 [2024-10-10 23:35:02,345 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:02,345 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:02,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-10 23:35:02,345 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:02,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:02,346 INFO L85 PathProgramCache]: Analyzing trace with hash -336080810, now seen corresponding path program 1 times [2024-10-10 23:35:02,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:02,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319429018] [2024-10-10 23:35:02,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:02,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:02,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:35:02,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319429018] [2024-10-10 23:35:02,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319429018] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:02,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991501325] [2024-10-10 23:35:02,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:02,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:02,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:02,730 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:35:02,731 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:35:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:02,948 INFO L255 TraceCheckSpWp]: Trace formula consists of 966 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:35:02,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:35:03,260 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 23:35:03,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1805 backedges. 1289 proven. 155 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2024-10-10 23:35:03,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991501325] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 23:35:03,570 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 23:35:03,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-10 23:35:03,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940053512] [2024-10-10 23:35:03,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 23:35:03,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:35:03,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:03,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:35:03,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:03,573 INFO L87 Difference]: Start difference. First operand 4453 states and 4764 transitions. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:04,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:04,397 INFO L93 Difference]: Finished difference Result 10151 states and 10908 transitions. [2024-10-10 23:35:04,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:35:04,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 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 784 [2024-10-10 23:35:04,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:04,407 INFO L225 Difference]: With dead ends: 10151 [2024-10-10 23:35:04,407 INFO L226 Difference]: Without dead ends: 5877 [2024-10-10 23:35:04,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1570 GetRequests, 1566 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:04,411 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 46 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 1308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:04,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 1308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:35:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5877 states. [2024-10-10 23:35:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5877 to 5165. [2024-10-10 23:35:04,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5165 states, 5164 states have (on average 1.0710689388071262) internal successors, (5531), 5164 states have internal predecessors, (5531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:04,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5165 states to 5165 states and 5531 transitions. [2024-10-10 23:35:04,459 INFO L78 Accepts]: Start accepts. Automaton has 5165 states and 5531 transitions. Word has length 784 [2024-10-10 23:35:04,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:04,460 INFO L471 AbstractCegarLoop]: Abstraction has 5165 states and 5531 transitions. [2024-10-10 23:35:04,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:04,461 INFO L276 IsEmpty]: Start isEmpty. Operand 5165 states and 5531 transitions. [2024-10-10 23:35:04,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2024-10-10 23:35:04,466 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:04,467 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:04,482 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:35:04,667 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,SelfDestructingSolverStorable13 [2024-10-10 23:35:04,668 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:04,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:04,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1635749033, now seen corresponding path program 1 times [2024-10-10 23:35:04,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:04,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79634763] [2024-10-10 23:35:04,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:04,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2283 backedges. 1470 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2024-10-10 23:35:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:04,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79634763] [2024-10-10 23:35:04,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79634763] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329936606] [2024-10-10 23:35:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:04,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:04,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:04,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:04,969 INFO L87 Difference]: Start difference. First operand 5165 states and 5531 transitions. Second operand has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:05,377 INFO L93 Difference]: Finished difference Result 11219 states and 12107 transitions. [2024-10-10 23:35:05,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 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 856 [2024-10-10 23:35:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:05,386 INFO L225 Difference]: With dead ends: 11219 [2024-10-10 23:35:05,386 INFO L226 Difference]: Without dead ends: 6233 [2024-10-10 23:35:05,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:05,393 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 107 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:05,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 31 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:05,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-10-10 23:35:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6233. [2024-10-10 23:35:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6232 states have (on average 1.0749358151476252) internal successors, (6699), 6232 states have internal predecessors, (6699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:05,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 6699 transitions. [2024-10-10 23:35:05,451 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 6699 transitions. Word has length 856 [2024-10-10 23:35:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:05,452 INFO L471 AbstractCegarLoop]: Abstraction has 6233 states and 6699 transitions. [2024-10-10 23:35:05,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 6699 transitions. [2024-10-10 23:35:05,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2024-10-10 23:35:05,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:05,459 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:05,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:35:05,459 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:05,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:05,459 INFO L85 PathProgramCache]: Analyzing trace with hash 62618474, now seen corresponding path program 1 times [2024-10-10 23:35:05,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:05,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436321896] [2024-10-10 23:35:05,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:05,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:06,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1527 proven. 93 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-10-10 23:35:06,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436321896] [2024-10-10 23:35:06,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436321896] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:06,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571613347] [2024-10-10 23:35:06,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:06,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:06,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:06,090 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:35:06,091 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:35:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:06,294 INFO L255 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:35:06,301 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:06,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2301 backedges. 1620 proven. 0 refuted. 0 times theorem prover too weak. 681 trivial. 0 not checked. [2024-10-10 23:35:06,687 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:06,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571613347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:06,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:06,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:35:06,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945826878] [2024-10-10 23:35:06,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:06,688 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:06,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:06,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:06,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:06,689 INFO L87 Difference]: Start difference. First operand 6233 states and 6699 transitions. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:07,045 INFO L93 Difference]: Finished difference Result 12643 states and 13590 transitions. [2024-10-10 23:35:07,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:07,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 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 874 [2024-10-10 23:35:07,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:07,053 INFO L225 Difference]: With dead ends: 12643 [2024-10-10 23:35:07,054 INFO L226 Difference]: Without dead ends: 6589 [2024-10-10 23:35:07,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 877 GetRequests, 873 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:07,059 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:07,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 63 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:07,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6589 states. [2024-10-10 23:35:07,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6589 to 6411. [2024-10-10 23:35:07,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6411 states, 6410 states have (on average 1.074414976599064) internal successors, (6887), 6410 states have internal predecessors, (6887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:07,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6411 states to 6411 states and 6887 transitions. [2024-10-10 23:35:07,113 INFO L78 Accepts]: Start accepts. Automaton has 6411 states and 6887 transitions. Word has length 874 [2024-10-10 23:35:07,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:07,114 INFO L471 AbstractCegarLoop]: Abstraction has 6411 states and 6887 transitions. [2024-10-10 23:35:07,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:07,114 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 6887 transitions. [2024-10-10 23:35:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2024-10-10 23:35:07,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:07,121 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:35:07,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-10 23:35:07,321 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,SelfDestructingSolverStorable15 [2024-10-10 23:35:07,322 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:07,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:07,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1705605088, now seen corresponding path program 1 times [2024-10-10 23:35:07,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:07,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993276011] [2024-10-10 23:35:07,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:07,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 2570 backedges. 1757 proven. 0 refuted. 0 times theorem prover too weak. 813 trivial. 0 not checked. [2024-10-10 23:35:08,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:08,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993276011] [2024-10-10 23:35:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993276011] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:08,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:08,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781140129] [2024-10-10 23:35:08,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:08,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:08,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:08,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:08,017 INFO L87 Difference]: Start difference. First operand 6411 states and 6887 transitions. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:08,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:08,369 INFO L93 Difference]: Finished difference Result 12465 states and 13414 transitions. [2024-10-10 23:35:08,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:08,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 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 942 [2024-10-10 23:35:08,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:08,376 INFO L225 Difference]: With dead ends: 12465 [2024-10-10 23:35:08,376 INFO L226 Difference]: Without dead ends: 6233 [2024-10-10 23:35:08,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:08,381 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 21 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:08,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 224 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:08,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6233 states. [2024-10-10 23:35:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6233 to 6233. [2024-10-10 23:35:08,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6233 states, 6232 states have (on average 1.0672336328626444) internal successors, (6651), 6232 states have internal predecessors, (6651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6233 states to 6233 states and 6651 transitions. [2024-10-10 23:35:08,428 INFO L78 Accepts]: Start accepts. Automaton has 6233 states and 6651 transitions. Word has length 942 [2024-10-10 23:35:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:08,428 INFO L471 AbstractCegarLoop]: Abstraction has 6233 states and 6651 transitions. [2024-10-10 23:35:08,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:08,429 INFO L276 IsEmpty]: Start isEmpty. Operand 6233 states and 6651 transitions. [2024-10-10 23:35:08,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 952 [2024-10-10 23:35:08,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:08,435 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 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, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:35:08,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-10 23:35:08,435 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:08,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:08,436 INFO L85 PathProgramCache]: Analyzing trace with hash -364411155, now seen corresponding path program 1 times [2024-10-10 23:35:08,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:08,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420903685] [2024-10-10 23:35:08,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:08,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:09,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1865 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2024-10-10 23:35:09,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420903685] [2024-10-10 23:35:09,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420903685] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:09,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056337531] [2024-10-10 23:35:09,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:09,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:09,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:09,333 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:35:09,338 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:35:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:09,549 INFO L255 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-10 23:35:09,557 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 2881 backedges. 1578 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2024-10-10 23:35:09,858 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:09,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056337531] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:09,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:09,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2024-10-10 23:35:09,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946249649] [2024-10-10 23:35:09,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:09,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:09,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:09,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:09,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:09,860 INFO L87 Difference]: Start difference. First operand 6233 states and 6651 transitions. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:10,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:10,561 INFO L93 Difference]: Finished difference Result 13533 states and 14440 transitions. [2024-10-10 23:35:10,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:10,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 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 951 [2024-10-10 23:35:10,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:10,574 INFO L225 Difference]: With dead ends: 13533 [2024-10-10 23:35:10,575 INFO L226 Difference]: Without dead ends: 7479 [2024-10-10 23:35:10,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 955 GetRequests, 950 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:10,580 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 107 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:10,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 51 Invalid, 941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 877 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:35:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7479 states. [2024-10-10 23:35:10,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7479 to 6767. [2024-10-10 23:35:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6767 states, 6766 states have (on average 1.0647354419154595) internal successors, (7204), 6766 states have internal predecessors, (7204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:10,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6767 states to 6767 states and 7204 transitions. [2024-10-10 23:35:10,640 INFO L78 Accepts]: Start accepts. Automaton has 6767 states and 7204 transitions. Word has length 951 [2024-10-10 23:35:10,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:10,640 INFO L471 AbstractCegarLoop]: Abstraction has 6767 states and 7204 transitions. [2024-10-10 23:35:10,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:10,640 INFO L276 IsEmpty]: Start isEmpty. Operand 6767 states and 7204 transitions. [2024-10-10 23:35:10,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 995 [2024-10-10 23:35:10,647 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:10,648 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 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, 5, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:10,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-10 23:35:10,848 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,SelfDestructingSolverStorable17 [2024-10-10 23:35:10,849 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:10,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:10,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1971281974, now seen corresponding path program 1 times [2024-10-10 23:35:10,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411728320] [2024-10-10 23:35:10,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:10,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3627 backedges. 1666 proven. 0 refuted. 0 times theorem prover too weak. 1961 trivial. 0 not checked. [2024-10-10 23:35:11,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:11,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411728320] [2024-10-10 23:35:11,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411728320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:11,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:11,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:35:11,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106553228] [2024-10-10 23:35:11,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:11,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-10 23:35:11,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:11,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-10 23:35:11,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:11,661 INFO L87 Difference]: Start difference. First operand 6767 states and 7204 transitions. Second operand has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 6 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:12,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:12,385 INFO L93 Difference]: Finished difference Result 12943 states and 13770 transitions. [2024-10-10 23:35:12,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-10 23:35:12,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 6 states have internal predecessors, (341), 0 states have call successors, (0), 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 994 [2024-10-10 23:35:12,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:12,393 INFO L225 Difference]: With dead ends: 12943 [2024-10-10 23:35:12,393 INFO L226 Difference]: Without dead ends: 6055 [2024-10-10 23:35:12,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:12,399 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 45 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:12,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 28 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1209 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:35:12,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2024-10-10 23:35:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 6055. [2024-10-10 23:35:12,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 6054 states have (on average 1.0525272547076314) internal successors, (6372), 6054 states have internal predecessors, (6372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:12,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 6372 transitions. [2024-10-10 23:35:12,507 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 6372 transitions. Word has length 994 [2024-10-10 23:35:12,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:12,508 INFO L471 AbstractCegarLoop]: Abstraction has 6055 states and 6372 transitions. [2024-10-10 23:35:12,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 48.714285714285715) internal successors, (341), 6 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:12,508 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 6372 transitions. [2024-10-10 23:35:12,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1038 [2024-10-10 23:35:12,514 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:12,515 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 23:35:12,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-10 23:35:12,515 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:12,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -666273994, now seen corresponding path program 1 times [2024-10-10 23:35:12,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:12,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286956681] [2024-10-10 23:35:12,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:12,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:12,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:13,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3176 backedges. 2056 proven. 0 refuted. 0 times theorem prover too weak. 1120 trivial. 0 not checked. [2024-10-10 23:35:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286956681] [2024-10-10 23:35:13,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286956681] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:13,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:13,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140129211] [2024-10-10 23:35:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:13,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:13,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:13,145 INFO L87 Difference]: Start difference. First operand 6055 states and 6372 transitions. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:13,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:13,488 INFO L93 Difference]: Finished difference Result 11931 states and 12564 transitions. [2024-10-10 23:35:13,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:13,489 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 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 1037 [2024-10-10 23:35:13,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:13,496 INFO L225 Difference]: With dead ends: 11931 [2024-10-10 23:35:13,496 INFO L226 Difference]: Without dead ends: 6055 [2024-10-10 23:35:13,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:35:13,502 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 24 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:13,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 216 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2024-10-10 23:35:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 5877. [2024-10-10 23:35:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5877 states, 5876 states have (on average 1.0474812797821647) internal successors, (6155), 5876 states have internal predecessors, (6155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:13,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5877 states to 5877 states and 6155 transitions. [2024-10-10 23:35:13,548 INFO L78 Accepts]: Start accepts. Automaton has 5877 states and 6155 transitions. Word has length 1037 [2024-10-10 23:35:13,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:13,548 INFO L471 AbstractCegarLoop]: Abstraction has 5877 states and 6155 transitions. [2024-10-10 23:35:13,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:13,548 INFO L276 IsEmpty]: Start isEmpty. Operand 5877 states and 6155 transitions. [2024-10-10 23:35:13,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1112 [2024-10-10 23:35:13,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:13,556 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2024-10-10 23:35:13,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-10 23:35:13,556 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:13,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:13,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1920442845, now seen corresponding path program 1 times [2024-10-10 23:35:13,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:13,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366454002] [2024-10-10 23:35:13,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:13,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:13,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 1611 proven. 95 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2024-10-10 23:35:14,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366454002] [2024-10-10 23:35:14,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366454002] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:14,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968634956] [2024-10-10 23:35:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:14,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:14,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:14,250 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:14,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-10 23:35:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:14,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 1335 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:35:14,495 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:14,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3504 backedges. 1706 proven. 0 refuted. 0 times theorem prover too weak. 1798 trivial. 0 not checked. [2024-10-10 23:35:14,653 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968634956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:14,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:14,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:35:14,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341604606] [2024-10-10 23:35:14,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:14,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:14,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:14,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:14,656 INFO L87 Difference]: Start difference. First operand 5877 states and 6155 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:15,019 INFO L93 Difference]: Finished difference Result 11753 states and 12309 transitions. [2024-10-10 23:35:15,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 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 1111 [2024-10-10 23:35:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:15,026 INFO L225 Difference]: With dead ends: 11753 [2024-10-10 23:35:15,026 INFO L226 Difference]: Without dead ends: 6055 [2024-10-10 23:35:15,030 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1114 GetRequests, 1110 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:15,031 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:15,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 218 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:15,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6055 states. [2024-10-10 23:35:15,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6055 to 5699. [2024-10-10 23:35:15,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5699 states, 5698 states have (on average 1.035977535977536) internal successors, (5903), 5698 states have internal predecessors, (5903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:15,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5699 states to 5699 states and 5903 transitions. [2024-10-10 23:35:15,075 INFO L78 Accepts]: Start accepts. Automaton has 5699 states and 5903 transitions. Word has length 1111 [2024-10-10 23:35:15,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:15,076 INFO L471 AbstractCegarLoop]: Abstraction has 5699 states and 5903 transitions. [2024-10-10 23:35:15,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:15,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5699 states and 5903 transitions. [2024-10-10 23:35:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1662 [2024-10-10 23:35:15,089 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:15,090 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 8, 7, 7, 7, 7, 7, 7, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:15,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-10 23:35:15,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:15,291 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:15,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash -600783802, now seen corresponding path program 1 times [2024-10-10 23:35:15,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:15,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673287421] [2024-10-10 23:35:15,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:15,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 1838 proven. 1045 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2024-10-10 23:35:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673287421] [2024-10-10 23:35:16,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673287421] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:16,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987186939] [2024-10-10 23:35:16,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:16,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:16,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:16,344 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:16,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-10 23:35:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:16,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 1991 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:35:16,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:16,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8507 backedges. 2883 proven. 0 refuted. 0 times theorem prover too weak. 5624 trivial. 0 not checked. [2024-10-10 23:35:16,868 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:16,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987186939] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:16,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:16,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 23:35:16,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364779384] [2024-10-10 23:35:16,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:16,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:16,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:16,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:16,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:16,871 INFO L87 Difference]: Start difference. First operand 5699 states and 5903 transitions. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:17,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:17,217 INFO L93 Difference]: Finished difference Result 12287 states and 12705 transitions. [2024-10-10 23:35:17,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:17,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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 1661 [2024-10-10 23:35:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:17,221 INFO L225 Difference]: With dead ends: 12287 [2024-10-10 23:35:17,222 INFO L226 Difference]: Without dead ends: 4275 [2024-10-10 23:35:17,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1664 GetRequests, 1660 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:35:17,226 INFO L432 NwaCegarLoop]: 225 mSDtfsCounter, 6 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:17,226 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 228 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:17,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2024-10-10 23:35:17,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4097. [2024-10-10 23:35:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.025390625) internal successors, (4200), 4096 states have internal predecessors, (4200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4200 transitions. [2024-10-10 23:35:17,254 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4200 transitions. Word has length 1661 [2024-10-10 23:35:17,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:17,255 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4200 transitions. [2024-10-10 23:35:17,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4200 transitions. [2024-10-10 23:35:17,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1715 [2024-10-10 23:35:17,268 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:17,269 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 9, 8, 8, 8, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:17,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-10 23:35:17,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-10 23:35:17,473 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:17,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1499889142, now seen corresponding path program 1 times [2024-10-10 23:35:17,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:17,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273475769] [2024-10-10 23:35:17,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:17,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:18,437 INFO L134 CoverageAnalysis]: Checked inductivity of 9643 backedges. 2874 proven. 0 refuted. 0 times theorem prover too weak. 6769 trivial. 0 not checked. [2024-10-10 23:35:18,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:18,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273475769] [2024-10-10 23:35:18,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273475769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:18,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:18,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:18,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221404657] [2024-10-10 23:35:18,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:18,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:18,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:18,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:18,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:18,440 INFO L87 Difference]: Start difference. First operand 4097 states and 4200 transitions. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:18,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:18,826 INFO L93 Difference]: Finished difference Result 8037 states and 8244 transitions. [2024-10-10 23:35:18,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:18,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 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 1714 [2024-10-10 23:35:18,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:18,830 INFO L225 Difference]: With dead ends: 8037 [2024-10-10 23:35:18,830 INFO L226 Difference]: Without dead ends: 4275 [2024-10-10 23:35:18,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:18,833 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 17 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:18,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 14 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4275 states. [2024-10-10 23:35:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4275 to 4097. [2024-10-10 23:35:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 4096 states have (on average 1.024169921875) internal successors, (4195), 4096 states have internal predecessors, (4195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:18,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 4195 transitions. [2024-10-10 23:35:18,858 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 4195 transitions. Word has length 1714 [2024-10-10 23:35:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:18,859 INFO L471 AbstractCegarLoop]: Abstraction has 4097 states and 4195 transitions. [2024-10-10 23:35:18,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:18,859 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 4195 transitions. [2024-10-10 23:35:18,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1733 [2024-10-10 23:35:18,872 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:18,873 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:18,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-10 23:35:18,873 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:18,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:18,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1675212902, now seen corresponding path program 1 times [2024-10-10 23:35:18,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:18,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902243311] [2024-10-10 23:35:18,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:18,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:21,152 INFO L134 CoverageAnalysis]: Checked inductivity of 9783 backedges. 1707 proven. 0 refuted. 0 times theorem prover too weak. 8076 trivial. 0 not checked. [2024-10-10 23:35:21,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:21,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902243311] [2024-10-10 23:35:21,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902243311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:21,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:21,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:35:21,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757312859] [2024-10-10 23:35:21,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:21,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-10 23:35:21,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:21,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-10 23:35:21,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:35:21,154 INFO L87 Difference]: Start difference. First operand 4097 states and 4195 transitions. Second operand has 5 states, 5 states have (on average 64.2) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:21,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:21,682 INFO L93 Difference]: Finished difference Result 9274 states and 9529 transitions. [2024-10-10 23:35:21,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-10 23:35:21,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 64.2) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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 1732 [2024-10-10 23:35:21,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:21,687 INFO L225 Difference]: With dead ends: 9274 [2024-10-10 23:35:21,687 INFO L226 Difference]: Without dead ends: 5521 [2024-10-10 23:35:21,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-10 23:35:21,692 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 138 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:21,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 17 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 23:35:21,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5521 states. [2024-10-10 23:35:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5521 to 4809. [2024-10-10 23:35:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0280782029950084) internal successors, (4943), 4808 states have internal predecessors, (4943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:21,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4943 transitions. [2024-10-10 23:35:21,733 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4943 transitions. Word has length 1732 [2024-10-10 23:35:21,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:21,733 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4943 transitions. [2024-10-10 23:35:21,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 64.2) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:21,734 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4943 transitions. [2024-10-10 23:35:21,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1738 [2024-10-10 23:35:21,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:21,747 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 8, 8, 8, 8, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:21,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-10 23:35:21,748 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:21,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:21,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1158885134, now seen corresponding path program 1 times [2024-10-10 23:35:21,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:21,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8523333] [2024-10-10 23:35:21,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:21,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:21,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 9838 backedges. 657 proven. 0 refuted. 0 times theorem prover too weak. 9181 trivial. 0 not checked. [2024-10-10 23:35:22,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:22,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8523333] [2024-10-10 23:35:22,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8523333] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:22,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:35:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653156925] [2024-10-10 23:35:22,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:22,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:22,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:22,607 INFO L87 Difference]: Start difference. First operand 4809 states and 4943 transitions. Second operand has 4 states, 4 states have (on average 60.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:22,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:22,972 INFO L93 Difference]: Finished difference Result 9451 states and 9720 transitions. [2024-10-10 23:35:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 1737 [2024-10-10 23:35:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:22,979 INFO L225 Difference]: With dead ends: 9451 [2024-10-10 23:35:22,979 INFO L226 Difference]: Without dead ends: 4987 [2024-10-10 23:35:22,981 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:22,982 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:22,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4987 states. [2024-10-10 23:35:23,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4987 to 4809. [2024-10-10 23:35:23,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.026830282861897) internal successors, (4937), 4808 states have internal predecessors, (4937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4937 transitions. [2024-10-10 23:35:23,047 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4937 transitions. Word has length 1737 [2024-10-10 23:35:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:23,048 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4937 transitions. [2024-10-10 23:35:23,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4937 transitions. [2024-10-10 23:35:23,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1903 [2024-10-10 23:35:23,064 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:23,065 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 10, 10, 10, 9, 9, 9, 9, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:23,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-10 23:35:23,065 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:23,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -479674386, now seen corresponding path program 1 times [2024-10-10 23:35:23,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:23,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156677266] [2024-10-10 23:35:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:23,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:24,401 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 2425 proven. 812 refuted. 0 times theorem prover too weak. 8272 trivial. 0 not checked. [2024-10-10 23:35:24,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156677266] [2024-10-10 23:35:24,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156677266] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:35:24,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1602403373] [2024-10-10 23:35:24,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:24,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:24,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:35:24,403 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 23:35:24,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-10 23:35:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:24,776 INFO L255 TraceCheckSpWp]: Trace formula consists of 2271 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 23:35:24,787 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:35:25,056 INFO L134 CoverageAnalysis]: Checked inductivity of 11509 backedges. 3237 proven. 0 refuted. 0 times theorem prover too weak. 8272 trivial. 0 not checked. [2024-10-10 23:35:25,056 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:35:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1602403373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:35:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:35:25,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053513329] [2024-10-10 23:35:25,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:25,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:35:25,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:35:25,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:25,059 INFO L87 Difference]: Start difference. First operand 4809 states and 4937 transitions. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:25,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:25,367 INFO L93 Difference]: Finished difference Result 9439 states and 9696 transitions. [2024-10-10 23:35:25,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:35:25,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 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 1902 [2024-10-10 23:35:25,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:25,371 INFO L225 Difference]: With dead ends: 9439 [2024-10-10 23:35:25,372 INFO L226 Difference]: Without dead ends: 4809 [2024-10-10 23:35:25,374 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1906 GetRequests, 1901 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:35:25,374 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 53 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:25,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 214 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 23:35:25,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2024-10-10 23:35:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2024-10-10 23:35:25,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 4808 states have (on average 1.0259983361064893) internal successors, (4933), 4808 states have internal predecessors, (4933), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:25,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 4933 transitions. [2024-10-10 23:35:25,408 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 4933 transitions. Word has length 1902 [2024-10-10 23:35:25,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:25,408 INFO L471 AbstractCegarLoop]: Abstraction has 4809 states and 4933 transitions. [2024-10-10 23:35:25,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:25,409 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 4933 transitions. [2024-10-10 23:35:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2035 [2024-10-10 23:35:25,426 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:35:25,426 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:25,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-10 23:35:25,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:35:25,631 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:35:25,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:35:25,631 INFO L85 PathProgramCache]: Analyzing trace with hash 78651299, now seen corresponding path program 1 times [2024-10-10 23:35:25,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:35:25,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780704159] [2024-10-10 23:35:25,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:35:25,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:35:25,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:35:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 13209 backedges. 1965 proven. 0 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2024-10-10 23:35:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:35:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780704159] [2024-10-10 23:35:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780704159] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:35:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:35:28,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-10 23:35:28,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814208082] [2024-10-10 23:35:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:35:28,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:35:28,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:35:28,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:35:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:28,208 INFO L87 Difference]: Start difference. First operand 4809 states and 4933 transitions. Second operand has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:35:28,632 INFO L93 Difference]: Finished difference Result 9094 states and 9337 transitions. [2024-10-10 23:35:28,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:35:28,633 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 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 2034 [2024-10-10 23:35:28,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:35:28,635 INFO L225 Difference]: With dead ends: 9094 [2024-10-10 23:35:28,635 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:35:28,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:35:28,639 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 107 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:35:28,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 12 Invalid, 603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 23:35:28,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:35:28,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:35:28,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:35:28,640 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2034 [2024-10-10 23:35:28,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:35:28,641 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:35:28,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.75) internal successors, (323), 4 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:35:28,641 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:35:28,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:35:28,643 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:35:28,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-10 23:35:28,646 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:35:28,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:35:29,695 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:35:29,711 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:35:29 BoogieIcfgContainer [2024-10-10 23:35:29,711 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:35:29,712 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:35:29,712 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:35:29,712 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:35:29,712 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:34:47" (3/4) ... [2024-10-10 23:35:29,714 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:35:29,726 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-10 23:35:29,727 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:35:29,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:35:29,728 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:35:29,868 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:35:29,869 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:35:29,869 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:35:29,869 INFO L158 Benchmark]: Toolchain (without parser) took 44638.34ms. Allocated memory was 178.3MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 126.9MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 794.8MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,869 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 104.9MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:35:29,870 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.33ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 137.4MB in the end (delta: -10.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,870 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.72ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 126.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,870 INFO L158 Benchmark]: Boogie Preprocessor took 99.62ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 114.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,873 INFO L158 Benchmark]: RCFGBuilder took 1058.30ms. Allocated memory was 178.3MB in the beginning and 234.9MB in the end (delta: 56.6MB). Free memory was 114.3MB in the beginning and 129.3MB in the end (delta: -15.0MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,873 INFO L158 Benchmark]: TraceAbstraction took 42673.26ms. Allocated memory was 234.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 129.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 726.7MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,873 INFO L158 Benchmark]: Witness Printer took 156.99ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-10 23:35:29,874 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 104.9MB. Free memory is still 70.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 545.33ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 137.4MB in the end (delta: -10.5MB). Peak memory consumption was 31.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.72ms. Allocated memory is still 178.3MB. Free memory was 137.4MB in the beginning and 126.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.62ms. Allocated memory is still 178.3MB. Free memory was 126.9MB in the beginning and 114.3MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1058.30ms. Allocated memory was 178.3MB in the beginning and 234.9MB in the end (delta: 56.6MB). Free memory was 114.3MB in the beginning and 129.3MB in the end (delta: -15.0MB). Peak memory consumption was 74.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42673.26ms. Allocated memory was 234.9MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 129.3MB in the beginning and 1.3GB in the end (delta: -1.1GB). Peak memory consumption was 726.7MB. Max. memory is 16.1GB. * Witness Printer took 156.99ms. Allocated memory is still 2.1GB. Free memory was 1.3GB in the beginning and 1.2GB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 161]: 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: 41.5s, OverallIterations: 27, TraceHistogramMax: 17, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 14.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2233 SdHoareTripleChecker+Valid, 13.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2233 mSDsluCounter, 2863 SdHoareTripleChecker+Invalid, 10.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 165 mSDsCounter, 1500 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15421 IncrementalHoareTripleChecker+Invalid, 16921 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1500 mSolverCounterUnsat, 2698 mSDtfsCounter, 15421 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9669 GetRequests, 9597 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6767occurred in iteration=18, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 27 MinimizatonAttempts, 5874 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 32497 NumberOfCodeBlocks, 32497 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 33244 ConstructedInterpolants, 0 QuantifiedInterpolants, 88792 SizeOfPredicates, 0 NumberOfNonLiveVariables, 10750 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 37 InterpolantComputations, 26 PerfectInterpolantSequences, 127061/129979 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 890]: Loop Invariant Derived loop invariant: ((((((((((((((((((((a24 == 1) && (7 == a21)) && (((long long) 49 + a12) <= 0)) && (a15 == 8)) || ((((a24 == 1) && (0 <= ((long long) a12 + 42))) && (a12 <= 586307)) && (8 <= a15))) || ((((a24 == 1) && (7 == a21)) && (0 <= ((long long) a12 + 42))) && (a12 <= 599999))) || ((((a24 == 1) && (a21 == 10)) && (81 <= a12)) && (7 == a15))) || (((a21 == 8) && (a24 == 1)) && (a15 <= 7))) || (((a21 <= 6) && (a15 <= 7)) && (((long long) 49 + a12) <= 0))) || ((((a24 == 1) && (a21 == 9)) && (a15 <= 7)) && (7 != a15))) || ((((a24 == 1) && (a15 <= 8)) && (a21 == 9)) && (((long long) 49 + a12) <= 0))) || (((a24 == 1) && (5 == a15)) && (a21 == 6))) || (((a24 == 1) && (((long long) 397559 + a12) <= 0)) && (a21 == 10))) || ((((a24 == 1) && (a21 <= 6)) && (a15 <= 7)) && (0 <= ((long long) a12 + 42)))) || ((((a24 == 1) && (10 <= a21)) && (a12 <= 599999)) && (8 <= a15))) || ((((a24 == 1) && (a21 == 9)) && (a15 <= 7)) && (0 <= ((long long) a12 + 42)))) || (((a24 == 1) && (7 == a21)) && (a15 <= 7))) || (((a21 == 8) && (a24 == 1)) && (a12 <= 599999))) || ((((a12 <= 73282) && (a24 == 1)) && (7 != a15)) && (10 <= a21))) || ((((a24 == 1) && (a21 == 9)) && (0 <= ((long long) a12 + 42))) && (a12 <= 599999))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:35:29,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE