./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/Problem16_label36.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/Problem16_label36.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 2937f5953993aa4d6e5a2b4e477fd67f649eb79fefa51556f9f9db8f2ffb7a65 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 23:42:28,978 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 23:42:29,053 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:42:29,059 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 23:42:29,061 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 23:42:29,094 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 23:42:29,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 23:42:29,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 23:42:29,097 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 23:42:29,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 23:42:29,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 23:42:29,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 23:42:29,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 23:42:29,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 23:42:29,102 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 23:42:29,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 23:42:29,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 23:42:29,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 23:42:29,105 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 23:42:29,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 23:42:29,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 23:42:29,106 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 23:42:29,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 23:42:29,107 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 23:42:29,107 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 23:42:29,107 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 23:42:29,107 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 23:42:29,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 23:42:29,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 23:42:29,108 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 23:42:29,108 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 23:42:29,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 23:42:29,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:42:29,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 23:42:29,109 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 23:42:29,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 23:42:29,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 23:42:29,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 23:42:29,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 23:42:29,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 23:42:29,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 23:42:29,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 23:42:29,112 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 -> 2937f5953993aa4d6e5a2b4e477fd67f649eb79fefa51556f9f9db8f2ffb7a65 [2024-10-10 23:42:29,373 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 23:42:29,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 23:42:29,402 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 23:42:29,404 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 23:42:29,404 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 23:42:29,405 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label36.c [2024-10-10 23:42:30,894 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 23:42:31,254 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 23:42:31,255 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label36.c [2024-10-10 23:42:31,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/84a7b961d/eb211b976efe48e4ae1a443cdfb5bb7c/FLAG33fe1c337 [2024-10-10 23:42:31,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/84a7b961d/eb211b976efe48e4ae1a443cdfb5bb7c [2024-10-10 23:42:31,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 23:42:31,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 23:42:31,305 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 23:42:31,306 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 23:42:31,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 23:42:31,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:42:31" (1/1) ... [2024-10-10 23:42:31,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@654dd22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:31, skipping insertion in model container [2024-10-10 23:42:31,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 11:42:31" (1/1) ... [2024-10-10 23:42:31,394 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 23:42:31,678 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/Problem16_label36.c[3906,3919] [2024-10-10 23:42:32,058 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:42:32,074 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 23:42:32,098 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/Problem16_label36.c[3906,3919] [2024-10-10 23:42:32,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 23:42:32,279 INFO L204 MainTranslator]: Completed translation [2024-10-10 23:42:32,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32 WrapperNode [2024-10-10 23:42:32,280 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 23:42:32,281 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 23:42:32,282 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 23:42:32,282 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 23:42:32,288 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:42:32" (1/1) ... [2024-10-10 23:42:32,324 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:42:32" (1/1) ... [2024-10-10 23:42:32,447 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-10-10 23:42:32,447 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 23:42:32,448 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 23:42:32,448 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 23:42:32,448 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 23:42:32,460 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,474 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,639 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:42:32,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,747 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,771 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,800 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,811 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 23:42:32,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 23:42:32,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 23:42:32,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 23:42:32,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (1/1) ... [2024-10-10 23:42:32,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 23:42:32,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:32,910 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:42:32,914 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:42:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 23:42:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 23:42:32,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 23:42:32,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 23:42:33,021 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 23:42:33,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 23:42:35,094 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-10-10 23:42:35,095 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 23:42:35,156 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 23:42:35,160 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 23:42:35,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:42:35 BoogieIcfgContainer [2024-10-10 23:42:35,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 23:42:35,163 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 23:42:35,163 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 23:42:35,167 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 23:42:35,167 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 11:42:31" (1/3) ... [2024-10-10 23:42:35,168 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2169c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:42:35, skipping insertion in model container [2024-10-10 23:42:35,168 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 11:42:32" (2/3) ... [2024-10-10 23:42:35,169 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2169c21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 11:42:35, skipping insertion in model container [2024-10-10 23:42:35,169 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:42:35" (3/3) ... [2024-10-10 23:42:35,170 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label36.c [2024-10-10 23:42:35,189 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 23:42:35,190 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 23:42:35,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 23:42:35,276 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;@29366504, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 23:42:35,276 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 23:42:35,285 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 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:42:35,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:42:35,299 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:35,300 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] [2024-10-10 23:42:35,302 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:35,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash -2009081248, now seen corresponding path program 1 times [2024-10-10 23:42:35,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:35,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801344020] [2024-10-10 23:42:35,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:35,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:35,528 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:42:35,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:35,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801344020] [2024-10-10 23:42:35,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801344020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:35,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:35,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:35,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244330102] [2024-10-10 23:42:35,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:35,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-10 23:42:35,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:35,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-10 23:42:35,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-10 23:42:35,567 INFO L87 Difference]: Start difference. First operand has 334 states, 332 states have (on average 1.9909638554216869) internal successors, (661), 333 states have internal predecessors, (661), 0 states have call successors, (0), 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 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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:42:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:35,629 INFO L93 Difference]: Finished difference Result 667 states and 1321 transitions. [2024-10-10 23:42:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-10 23:42:35,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:42:35,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:35,644 INFO L225 Difference]: With dead ends: 667 [2024-10-10 23:42:35,644 INFO L226 Difference]: Without dead ends: 332 [2024-10-10 23:42:35,649 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:42:35,654 INFO L432 NwaCegarLoop]: 596 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, 596 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:42:35,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 596 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-10 23:42:35,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2024-10-10 23:42:35,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2024-10-10 23:42:35,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.8006042296072509) internal successors, (596), 331 states have internal predecessors, (596), 0 states have call successors, (0), 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:42:35,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 596 transitions. [2024-10-10 23:42:35,721 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 596 transitions. Word has length 35 [2024-10-10 23:42:35,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:35,721 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 596 transitions. [2024-10-10 23:42:35,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 0 states have call successors, (0), 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:42:35,722 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 596 transitions. [2024-10-10 23:42:35,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-10 23:42:35,723 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:35,723 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] [2024-10-10 23:42:35,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 23:42:35,725 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:35,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:35,726 INFO L85 PathProgramCache]: Analyzing trace with hash 512329990, now seen corresponding path program 1 times [2024-10-10 23:42:35,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:35,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965361183] [2024-10-10 23:42:35,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:35,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:35,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:36,004 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:42:36,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:36,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965361183] [2024-10-10 23:42:36,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965361183] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:36,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:36,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:36,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915947454] [2024-10-10 23:42:36,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:36,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:36,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:36,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:36,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:36,008 INFO L87 Difference]: Start difference. First operand 332 states and 596 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:42:38,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:38,344 INFO L93 Difference]: Finished difference Result 1321 states and 2379 transitions. [2024-10-10 23:42:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:42:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2024-10-10 23:42:38,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:38,351 INFO L225 Difference]: With dead ends: 1321 [2024-10-10 23:42:38,351 INFO L226 Difference]: Without dead ends: 990 [2024-10-10 23:42:38,356 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:42:38,359 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 1028 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 674 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1028 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 674 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:38,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1028 Valid, 66 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [674 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-10 23:42:38,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-10 23:42:38,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 990. [2024-10-10 23:42:38,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 989 states have (on average 1.4984833164812943) internal successors, (1482), 989 states have internal predecessors, (1482), 0 states have call successors, (0), 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:42:38,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1482 transitions. [2024-10-10 23:42:38,428 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1482 transitions. Word has length 35 [2024-10-10 23:42:38,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:38,429 INFO L471 AbstractCegarLoop]: Abstraction has 990 states and 1482 transitions. [2024-10-10 23:42:38,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:42:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1482 transitions. [2024-10-10 23:42:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2024-10-10 23:42:38,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:38,440 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:42:38,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 23:42:38,441 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:38,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:38,446 INFO L85 PathProgramCache]: Analyzing trace with hash -421364994, now seen corresponding path program 1 times [2024-10-10 23:42:38,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:38,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618199262] [2024-10-10 23:42:38,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:38,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 23:42:38,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:38,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618199262] [2024-10-10 23:42:38,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618199262] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:38,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:38,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:38,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876030579] [2024-10-10 23:42:38,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:38,797 INFO L87 Difference]: Start difference. First operand 990 states and 1482 transitions. Second operand has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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:42:40,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:40,140 INFO L93 Difference]: Finished difference Result 1979 states and 3167 transitions. [2024-10-10 23:42:40,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:40,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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 225 [2024-10-10 23:42:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:40,146 INFO L225 Difference]: With dead ends: 1979 [2024-10-10 23:42:40,146 INFO L226 Difference]: Without dead ends: 1319 [2024-10-10 23:42:40,148 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:42:40,149 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 279 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 797 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:40,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 536 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 797 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 23:42:40,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2024-10-10 23:42:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2024-10-10 23:42:40,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1319 states, 1318 states have (on average 1.4241274658573597) internal successors, (1877), 1318 states have internal predecessors, (1877), 0 states have call successors, (0), 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:42:40,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1877 transitions. [2024-10-10 23:42:40,179 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1877 transitions. Word has length 225 [2024-10-10 23:42:40,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:40,182 INFO L471 AbstractCegarLoop]: Abstraction has 1319 states and 1877 transitions. [2024-10-10 23:42:40,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.0) internal successors, (225), 3 states have internal predecessors, (225), 0 states have call successors, (0), 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:42:40,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1877 transitions. [2024-10-10 23:42:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 23:42:40,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:40,191 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-10 23:42:40,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 23:42:40,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:40,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:40,195 INFO L85 PathProgramCache]: Analyzing trace with hash 916880904, now seen corresponding path program 1 times [2024-10-10 23:42:40,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:40,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976223922] [2024-10-10 23:42:40,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:40,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:40,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:40,476 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2024-10-10 23:42:40,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:40,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976223922] [2024-10-10 23:42:40,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976223922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:40,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:40,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:40,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49388117] [2024-10-10 23:42:40,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:40,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:40,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:40,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:40,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:40,483 INFO L87 Difference]: Start difference. First operand 1319 states and 1877 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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:42:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:41,903 INFO L93 Difference]: Finished difference Result 3295 states and 4946 transitions. [2024-10-10 23:42:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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 228 [2024-10-10 23:42:41,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:41,912 INFO L225 Difference]: With dead ends: 3295 [2024-10-10 23:42:41,912 INFO L226 Difference]: Without dead ends: 1977 [2024-10-10 23:42:41,917 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:42:41,919 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 339 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 1180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:41,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 154 Invalid, 1180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-10 23:42:41,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1977 states. [2024-10-10 23:42:41,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1977 to 1977. [2024-10-10 23:42:41,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1977 states, 1976 states have (on average 1.1336032388663968) internal successors, (2240), 1976 states have internal predecessors, (2240), 0 states have call successors, (0), 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:42:41,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1977 states to 1977 states and 2240 transitions. [2024-10-10 23:42:41,960 INFO L78 Accepts]: Start accepts. Automaton has 1977 states and 2240 transitions. Word has length 228 [2024-10-10 23:42:41,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:41,961 INFO L471 AbstractCegarLoop]: Abstraction has 1977 states and 2240 transitions. [2024-10-10 23:42:41,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 2 states have internal predecessors, (143), 0 states have call successors, (0), 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:42:41,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1977 states and 2240 transitions. [2024-10-10 23:42:41,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2024-10-10 23:42:41,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:41,968 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:41,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-10 23:42:41,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:41,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:41,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2096784185, now seen corresponding path program 1 times [2024-10-10 23:42:41,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:41,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747726337] [2024-10-10 23:42:41,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:41,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:42,251 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 235 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-10 23:42:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747726337] [2024-10-10 23:42:42,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747726337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:42,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:42,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870034989] [2024-10-10 23:42:42,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:42,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:42,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:42,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:42,256 INFO L87 Difference]: Start difference. First operand 1977 states and 2240 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:43,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:43,169 INFO L93 Difference]: Finished difference Result 3953 states and 4507 transitions. [2024-10-10 23:42:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:43,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 354 [2024-10-10 23:42:43,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:43,178 INFO L225 Difference]: With dead ends: 3953 [2024-10-10 23:42:43,179 INFO L226 Difference]: Without dead ends: 2306 [2024-10-10 23:42:43,181 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:42:43,182 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 262 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:43,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 29 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:42:43,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2306 states. [2024-10-10 23:42:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2306 to 2306. [2024-10-10 23:42:43,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 2305 states have (on average 1.0928416485900216) internal successors, (2519), 2305 states have internal predecessors, (2519), 0 states have call successors, (0), 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:42:43,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2519 transitions. [2024-10-10 23:42:43,233 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2519 transitions. Word has length 354 [2024-10-10 23:42:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:43,234 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 2519 transitions. [2024-10-10 23:42:43,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 2 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:42:43,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2519 transitions. [2024-10-10 23:42:43,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2024-10-10 23:42:43,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:43,248 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:42:43,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 23:42:43,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:43,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:43,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1816686343, now seen corresponding path program 1 times [2024-10-10 23:42:43,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:43,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024477009] [2024-10-10 23:42:43,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:43,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:43,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:44,309 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 623 proven. 0 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2024-10-10 23:42:44,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:44,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024477009] [2024-10-10 23:42:44,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024477009] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:44,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:44,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:44,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429648582] [2024-10-10 23:42:44,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:44,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:44,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:44,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:44,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:44,314 INFO L87 Difference]: Start difference. First operand 2306 states and 2519 transitions. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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:42:45,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:45,977 INFO L93 Difference]: Finished difference Result 7903 states and 8695 transitions. [2024-10-10 23:42:45,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-10 23:42:45,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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 612 [2024-10-10 23:42:45,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:45,997 INFO L225 Difference]: With dead ends: 7903 [2024-10-10 23:42:45,998 INFO L226 Difference]: Without dead ends: 5927 [2024-10-10 23:42:46,001 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:42:46,002 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 303 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1689 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 1689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:46,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 108 Invalid, 1789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 1689 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-10 23:42:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5927 states. [2024-10-10 23:42:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5927 to 5596. [2024-10-10 23:42:46,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5596 states, 5595 states have (on average 1.0804289544235925) internal successors, (6045), 5595 states have internal predecessors, (6045), 0 states have call successors, (0), 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:42:46,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5596 states to 5596 states and 6045 transitions. [2024-10-10 23:42:46,109 INFO L78 Accepts]: Start accepts. Automaton has 5596 states and 6045 transitions. Word has length 612 [2024-10-10 23:42:46,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:46,110 INFO L471 AbstractCegarLoop]: Abstraction has 5596 states and 6045 transitions. [2024-10-10 23:42:46,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 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:42:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 5596 states and 6045 transitions. [2024-10-10 23:42:46,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 709 [2024-10-10 23:42:46,124 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:46,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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:46,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 23:42:46,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:46,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:46,125 INFO L85 PathProgramCache]: Analyzing trace with hash -796129715, now seen corresponding path program 1 times [2024-10-10 23:42:46,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:46,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115257956] [2024-10-10 23:42:46,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:46,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:46,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:46,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 694 proven. 0 refuted. 0 times theorem prover too weak. 520 trivial. 0 not checked. [2024-10-10 23:42:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:46,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115257956] [2024-10-10 23:42:46,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115257956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:46,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:46,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 23:42:46,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123688223] [2024-10-10 23:42:46,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:46,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:46,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:46,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:46,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:46,880 INFO L87 Difference]: Start difference. First operand 5596 states and 6045 transitions. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 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:42:47,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:47,954 INFO L93 Difference]: Finished difference Result 13167 states and 14283 transitions. [2024-10-10 23:42:47,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:47,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 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:42:47,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:47,981 INFO L225 Difference]: With dead ends: 13167 [2024-10-10 23:42:47,981 INFO L226 Difference]: Without dead ends: 7901 [2024-10-10 23:42:47,989 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:42:47,990 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 100 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:47,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 35 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-10 23:42:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7901 states. [2024-10-10 23:42:48,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7901 to 7899. [2024-10-10 23:42:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7899 states, 7898 states have (on average 1.0786275006330717) internal successors, (8519), 7898 states have internal predecessors, (8519), 0 states have call successors, (0), 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:42:48,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7899 states to 7899 states and 8519 transitions. [2024-10-10 23:42:48,132 INFO L78 Accepts]: Start accepts. Automaton has 7899 states and 8519 transitions. Word has length 708 [2024-10-10 23:42:48,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:48,133 INFO L471 AbstractCegarLoop]: Abstraction has 7899 states and 8519 transitions. [2024-10-10 23:42:48,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 2 states have internal predecessors, (366), 0 states have call successors, (0), 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:42:48,134 INFO L276 IsEmpty]: Start isEmpty. Operand 7899 states and 8519 transitions. [2024-10-10 23:42:48,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 717 [2024-10-10 23:42:48,150 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:48,151 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:48,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 23:42:48,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:48,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:48,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1091468601, now seen corresponding path program 1 times [2024-10-10 23:42:48,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:48,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97776780] [2024-10-10 23:42:48,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:48,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:48,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:49,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1214 backedges. 945 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-10-10 23:42:49,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:49,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97776780] [2024-10-10 23:42:49,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97776780] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:49,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:49,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:49,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734558420] [2024-10-10 23:42:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:49,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:49,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:49,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:49,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:42:49,026 INFO L87 Difference]: Start difference. First operand 7899 states and 8519 transitions. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 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:42:50,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:50,060 INFO L93 Difference]: Finished difference Result 19416 states and 21034 transitions. [2024-10-10 23:42:50,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:50,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 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 716 [2024-10-10 23:42:50,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:50,113 INFO L225 Difference]: With dead ends: 19416 [2024-10-10 23:42:50,113 INFO L226 Difference]: Without dead ends: 12176 [2024-10-10 23:42:50,129 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:42:50,130 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 220 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:50,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 36 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-10 23:42:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12176 states. [2024-10-10 23:42:50,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12176 to 11189. [2024-10-10 23:42:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0775831247765464) internal successors, (12056), 11188 states have internal predecessors, (12056), 0 states have call successors, (0), 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:42:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 12056 transitions. [2024-10-10 23:42:50,351 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 12056 transitions. Word has length 716 [2024-10-10 23:42:50,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:50,352 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 12056 transitions. [2024-10-10 23:42:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 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:42:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 12056 transitions. [2024-10-10 23:42:50,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2024-10-10 23:42:50,374 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:50,375 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:50,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-10 23:42:50,375 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:50,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:50,376 INFO L85 PathProgramCache]: Analyzing trace with hash -270990961, now seen corresponding path program 1 times [2024-10-10 23:42:50,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:50,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78062468] [2024-10-10 23:42:50,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:50,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:52,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1770 proven. 0 refuted. 0 times theorem prover too weak. 2108 trivial. 0 not checked. [2024-10-10 23:42:52,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:52,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78062468] [2024-10-10 23:42:52,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78062468] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:52,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:42:52,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:42:52,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199481193] [2024-10-10 23:42:52,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:52,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-10 23:42:52,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:52,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-10 23:42:52,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-10 23:42:52,011 INFO L87 Difference]: Start difference. First operand 11189 states and 12056 transitions. Second operand has 4 states, 4 states have (on average 143.0) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 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:42:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:52,863 INFO L93 Difference]: Finished difference Result 21719 states and 23444 transitions. [2024-10-10 23:42:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:52,864 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 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 1211 [2024-10-10 23:42:52,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:52,884 INFO L225 Difference]: With dead ends: 21719 [2024-10-10 23:42:52,884 INFO L226 Difference]: Without dead ends: 11189 [2024-10-10 23:42:52,896 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:42:52,897 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 267 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:52,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 103 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:42:52,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11189 states. [2024-10-10 23:42:53,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11189 to 11189. [2024-10-10 23:42:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11189 states, 11188 states have (on average 1.0773149803360744) internal successors, (12053), 11188 states have internal predecessors, (12053), 0 states have call successors, (0), 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:42:53,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11189 states to 11189 states and 12053 transitions. [2024-10-10 23:42:53,169 INFO L78 Accepts]: Start accepts. Automaton has 11189 states and 12053 transitions. Word has length 1211 [2024-10-10 23:42:53,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:53,171 INFO L471 AbstractCegarLoop]: Abstraction has 11189 states and 12053 transitions. [2024-10-10 23:42:53,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 143.0) internal successors, (572), 3 states have internal predecessors, (572), 0 states have call successors, (0), 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:42:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 11189 states and 12053 transitions. [2024-10-10 23:42:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1220 [2024-10-10 23:42:53,204 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:53,206 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 23:42:53,206 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1032859357, now seen corresponding path program 1 times [2024-10-10 23:42:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:53,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365470670] [2024-10-10 23:42:53,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:53,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:53,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 1613 proven. 157 refuted. 0 times theorem prover too weak. 2108 trivial. 0 not checked. [2024-10-10 23:42:55,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365470670] [2024-10-10 23:42:55,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365470670] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:42:55,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060320971] [2024-10-10 23:42:55,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:55,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:55,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:55,674 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:42:55,676 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:42:56,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:56,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 1468 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:42:56,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:42:56,308 INFO L134 CoverageAnalysis]: Checked inductivity of 3878 backedges. 2591 proven. 0 refuted. 0 times theorem prover too weak. 1287 trivial. 0 not checked. [2024-10-10 23:42:56,308 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:42:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060320971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:42:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:42:56,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:42:56,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560206731] [2024-10-10 23:42:56,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:42:56,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:42:56,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:42:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:42:56,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:56,312 INFO L87 Difference]: Start difference. First operand 11189 states and 12053 transitions. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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:42:57,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:42:57,219 INFO L93 Difference]: Finished difference Result 24680 states and 26663 transitions. [2024-10-10 23:42:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:42:57,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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 1219 [2024-10-10 23:42:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:42:57,245 INFO L225 Difference]: With dead ends: 24680 [2024-10-10 23:42:57,246 INFO L226 Difference]: Without dead ends: 14150 [2024-10-10 23:42:57,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1223 GetRequests, 1218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:42:57,262 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 235 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 134 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 134 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-10 23:42:57,262 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 30 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [134 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-10 23:42:57,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14150 states. [2024-10-10 23:42:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14150 to 12505. [2024-10-10 23:42:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12505 states, 12504 states have (on average 1.081973768394114) internal successors, (13529), 12504 states have internal predecessors, (13529), 0 states have call successors, (0), 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:42:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12505 states to 12505 states and 13529 transitions. [2024-10-10 23:42:57,435 INFO L78 Accepts]: Start accepts. Automaton has 12505 states and 13529 transitions. Word has length 1219 [2024-10-10 23:42:57,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:42:57,436 INFO L471 AbstractCegarLoop]: Abstraction has 12505 states and 13529 transitions. [2024-10-10 23:42:57,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 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:42:57,436 INFO L276 IsEmpty]: Start isEmpty. Operand 12505 states and 13529 transitions. [2024-10-10 23:42:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2024-10-10 23:42:57,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:42:57,458 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, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:57,479 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:42:57,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-10 23:42:57,663 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:42:57,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:42:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1080492730, now seen corresponding path program 1 times [2024-10-10 23:42:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:42:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645182254] [2024-10-10 23:42:57,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:42:57,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:42:59,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 1615 proven. 157 refuted. 0 times theorem prover too weak. 2114 trivial. 0 not checked. [2024-10-10 23:42:59,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:42:59,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645182254] [2024-10-10 23:42:59,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645182254] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:42:59,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351948669] [2024-10-10 23:42:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:42:59,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:42:59,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:42:59,972 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:42:59,973 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:43:00,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:00,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 1472 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:43:00,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:43:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 3886 backedges. 2543 proven. 0 refuted. 0 times theorem prover too weak. 1343 trivial. 0 not checked. [2024-10-10 23:43:00,559 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:43:00,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351948669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:00,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:43:00,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:43:00,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867457311] [2024-10-10 23:43:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:00,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:00,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:00,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:00,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:43:00,564 INFO L87 Difference]: Start difference. First operand 12505 states and 13529 transitions. Second operand has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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:43:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:01,339 INFO L93 Difference]: Finished difference Result 26325 states and 28488 transitions. [2024-10-10 23:43:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:01,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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 1220 [2024-10-10 23:43:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:01,365 INFO L225 Difference]: With dead ends: 26325 [2024-10-10 23:43:01,365 INFO L226 Difference]: Without dead ends: 14479 [2024-10-10 23:43:01,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1224 GetRequests, 1219 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:43:01,381 INFO L432 NwaCegarLoop]: 391 mSDtfsCounter, 198 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:01,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 395 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:43:01,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14479 states. [2024-10-10 23:43:01,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14479 to 13821. [2024-10-10 23:43:01,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13821 states, 13820 states have (on average 1.0537626628075254) internal successors, (14563), 13820 states have internal predecessors, (14563), 0 states have call successors, (0), 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:43:01,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13821 states to 13821 states and 14563 transitions. [2024-10-10 23:43:01,563 INFO L78 Accepts]: Start accepts. Automaton has 13821 states and 14563 transitions. Word has length 1220 [2024-10-10 23:43:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:01,565 INFO L471 AbstractCegarLoop]: Abstraction has 13821 states and 14563 transitions. [2024-10-10 23:43:01,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.0) internal successors, (561), 3 states have internal predecessors, (561), 0 states have call successors, (0), 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:43:01,565 INFO L276 IsEmpty]: Start isEmpty. Operand 13821 states and 14563 transitions. [2024-10-10 23:43:01,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1262 [2024-10-10 23:43:01,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:01,589 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, 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, 7, 7, 7, 7, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:43:01,610 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:43:01,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:43:01,794 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:01,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:01,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1430331323, now seen corresponding path program 1 times [2024-10-10 23:43:01,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:01,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803153518] [2024-10-10 23:43:01,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:01,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:03,764 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 1607 proven. 157 refuted. 0 times theorem prover too weak. 1712 trivial. 0 not checked. [2024-10-10 23:43:03,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:03,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803153518] [2024-10-10 23:43:03,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803153518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:43:03,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [545535525] [2024-10-10 23:43:03,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:03,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:43:03,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:43:03,767 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:43:03,769 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:43:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:04,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 1493 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:43:04,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:43:04,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3476 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 2298 trivial. 0 not checked. [2024-10-10 23:43:04,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:43:04,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [545535525] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:04,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:43:04,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:43:04,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679141913] [2024-10-10 23:43:04,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:04,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:04,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:04,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:04,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:43:04,376 INFO L87 Difference]: Start difference. First operand 13821 states and 14563 transitions. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:43:05,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:05,105 INFO L93 Difference]: Finished difference Result 28628 states and 30145 transitions. [2024-10-10 23:43:05,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:05,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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 1261 [2024-10-10 23:43:05,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:05,134 INFO L225 Difference]: With dead ends: 28628 [2024-10-10 23:43:05,134 INFO L226 Difference]: Without dead ends: 13492 [2024-10-10 23:43:05,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1265 GetRequests, 1260 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:43:05,151 INFO L432 NwaCegarLoop]: 386 mSDtfsCounter, 179 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:05,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 390 Invalid, 815 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:43:05,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13492 states. [2024-10-10 23:43:05,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13492 to 13163. [2024-10-10 23:43:05,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13163 states, 13162 states have (on average 1.0430025831940435) internal successors, (13728), 13162 states have internal predecessors, (13728), 0 states have call successors, (0), 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:43:05,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13163 states to 13163 states and 13728 transitions. [2024-10-10 23:43:05,369 INFO L78 Accepts]: Start accepts. Automaton has 13163 states and 13728 transitions. Word has length 1261 [2024-10-10 23:43:05,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:05,370 INFO L471 AbstractCegarLoop]: Abstraction has 13163 states and 13728 transitions. [2024-10-10 23:43:05,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 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:43:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 13163 states and 13728 transitions. [2024-10-10 23:43:05,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1379 [2024-10-10 23:43:05,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:05,401 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, 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, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:43:05,420 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:43:05,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:43:05,602 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:05,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:05,603 INFO L85 PathProgramCache]: Analyzing trace with hash 1635773765, now seen corresponding path program 1 times [2024-10-10 23:43:05,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:05,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632347543] [2024-10-10 23:43:05,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:05,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:05,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:07,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 1846 proven. 157 refuted. 0 times theorem prover too weak. 2181 trivial. 0 not checked. [2024-10-10 23:43:07,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:07,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632347543] [2024-10-10 23:43:07,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632347543] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:43:07,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879603996] [2024-10-10 23:43:07,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:07,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:43:07,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:43:07,440 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:43:07,442 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:43:07,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:07,815 INFO L255 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:43:07,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:43:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4184 backedges. 2820 proven. 0 refuted. 0 times theorem prover too weak. 1364 trivial. 0 not checked. [2024-10-10 23:43:08,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:43:08,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879603996] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:08,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:43:08,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-10-10 23:43:08,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53789577] [2024-10-10 23:43:08,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:08,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:08,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:08,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:08,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:43:08,031 INFO L87 Difference]: Start difference. First operand 13163 states and 13728 transitions. Second operand has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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:43:08,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:08,787 INFO L93 Difference]: Finished difference Result 28628 states and 29953 transitions. [2024-10-10 23:43:08,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:08,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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 1378 [2024-10-10 23:43:08,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:08,814 INFO L225 Difference]: With dead ends: 28628 [2024-10-10 23:43:08,814 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:43:08,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1382 GetRequests, 1377 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-10-10 23:43:08,827 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 199 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:08,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 88 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-10 23:43:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:43:08,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2024-10-10 23:43:09,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0392606834956273) internal successors, (16756), 16123 states have internal predecessors, (16756), 0 states have call successors, (0), 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:43:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16756 transitions. [2024-10-10 23:43:09,019 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16756 transitions. Word has length 1378 [2024-10-10 23:43:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:09,020 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16756 transitions. [2024-10-10 23:43:09,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 0 states have call successors, (0), 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:43:09,021 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16756 transitions. [2024-10-10 23:43:09,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1443 [2024-10-10 23:43:09,058 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:09,059 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:43:09,080 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:43:09,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 23:43:09,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:09,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:09,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1229022942, now seen corresponding path program 1 times [2024-10-10 23:43:09,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:09,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955040041] [2024-10-10 23:43:09,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:09,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:09,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 4007 backedges. 1085 proven. 1546 refuted. 0 times theorem prover too weak. 1376 trivial. 0 not checked. [2024-10-10 23:43:11,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:11,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955040041] [2024-10-10 23:43:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955040041] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 23:43:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962582622] [2024-10-10 23:43:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:11,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 23:43:11,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 23:43:11,158 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:43:11,159 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:43:11,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:11,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 23:43:11,551 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 23:43:11,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4007 backedges. 1256 proven. 0 refuted. 0 times theorem prover too weak. 2751 trivial. 0 not checked. [2024-10-10 23:43:11,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 23:43:11,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [962582622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:11,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 23:43:11,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-10-10 23:43:11,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659931771] [2024-10-10 23:43:11,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:11,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:11,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:11,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:11,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:43:11,782 INFO L87 Difference]: Start difference. First operand 16124 states and 16756 transitions. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:12,479 INFO L93 Difference]: Finished difference Result 31918 states and 33180 transitions. [2024-10-10 23:43:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1442 [2024-10-10 23:43:12,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:12,507 INFO L225 Difference]: With dead ends: 31918 [2024-10-10 23:43:12,508 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:43:12,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1447 GetRequests, 1443 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:43:12,521 INFO L432 NwaCegarLoop]: 356 mSDtfsCounter, 169 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:12,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 360 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:43:12,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:43:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2024-10-10 23:43:12,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.0341747813682318) internal successors, (16674), 16123 states have internal predecessors, (16674), 0 states have call successors, (0), 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:43:12,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16674 transitions. [2024-10-10 23:43:12,821 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16674 transitions. Word has length 1442 [2024-10-10 23:43:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:12,822 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16674 transitions. [2024-10-10 23:43:12,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 23:43:12,822 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16674 transitions. [2024-10-10 23:43:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1472 [2024-10-10 23:43:12,848 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:12,849 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, 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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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:43:12,871 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-10 23:43:13,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-10 23:43:13,050 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:13,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 951670157, now seen corresponding path program 1 times [2024-10-10 23:43:13,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:13,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649690956] [2024-10-10 23:43:13,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:13,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:14,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4038 backedges. 2302 proven. 0 refuted. 0 times theorem prover too weak. 1736 trivial. 0 not checked. [2024-10-10 23:43:14,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:14,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649690956] [2024-10-10 23:43:14,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649690956] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:14,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:43:14,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 23:43:14,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432850388] [2024-10-10 23:43:14,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:14,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 23:43:14,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:14,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 23:43:14,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 23:43:14,697 INFO L87 Difference]: Start difference. First operand 16124 states and 16674 transitions. Second operand has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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:43:15,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:15,356 INFO L93 Difference]: Finished difference Result 31589 states and 32685 transitions. [2024-10-10 23:43:15,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 23:43:15,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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 1471 [2024-10-10 23:43:15,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:15,380 INFO L225 Difference]: With dead ends: 31589 [2024-10-10 23:43:15,380 INFO L226 Difference]: Without dead ends: 16124 [2024-10-10 23:43:15,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:43:15,393 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 93 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:15,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 374 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-10 23:43:15,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16124 states. [2024-10-10 23:43:15,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16124 to 16124. [2024-10-10 23:43:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16124 states, 16123 states have (on average 1.032190039074614) internal successors, (16642), 16123 states have internal predecessors, (16642), 0 states have call successors, (0), 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:43:15,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16124 states to 16124 states and 16642 transitions. [2024-10-10 23:43:15,567 INFO L78 Accepts]: Start accepts. Automaton has 16124 states and 16642 transitions. Word has length 1471 [2024-10-10 23:43:15,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:15,568 INFO L471 AbstractCegarLoop]: Abstraction has 16124 states and 16642 transitions. [2024-10-10 23:43:15,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 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:43:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 16124 states and 16642 transitions. [2024-10-10 23:43:15,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1754 [2024-10-10 23:43:15,599 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 23:43:15,600 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, 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 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, 1, 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:43:15,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 23:43:15,600 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 23:43:15,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 23:43:15,601 INFO L85 PathProgramCache]: Analyzing trace with hash -2040772112, now seen corresponding path program 1 times [2024-10-10 23:43:15,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 23:43:15,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283233762] [2024-10-10 23:43:15,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 23:43:15,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 23:43:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 23:43:17,294 INFO L134 CoverageAnalysis]: Checked inductivity of 5507 backedges. 3529 proven. 0 refuted. 0 times theorem prover too weak. 1978 trivial. 0 not checked. [2024-10-10 23:43:17,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 23:43:17,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283233762] [2024-10-10 23:43:17,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283233762] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 23:43:17,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 23:43:17,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-10 23:43:17,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548745507] [2024-10-10 23:43:17,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 23:43:17,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-10 23:43:17,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 23:43:17,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-10 23:43:17,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:43:17,297 INFO L87 Difference]: Start difference. First operand 16124 states and 16642 transitions. Second operand has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 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:43:18,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 23:43:18,563 INFO L93 Difference]: Finished difference Result 31285 states and 32317 transitions. [2024-10-10 23:43:18,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-10 23:43:18,564 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 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 1753 [2024-10-10 23:43:18,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 23:43:18,565 INFO L225 Difference]: With dead ends: 31285 [2024-10-10 23:43:18,565 INFO L226 Difference]: Without dead ends: 0 [2024-10-10 23:43:18,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-10 23:43:18,579 INFO L432 NwaCegarLoop]: 407 mSDtfsCounter, 141 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 2207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-10 23:43:18,579 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 426 Invalid, 2207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-10 23:43:18,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-10 23:43:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-10 23:43:18,580 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:43:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-10 23:43:18,581 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1753 [2024-10-10 23:43:18,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 23:43:18,581 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-10 23:43:18,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 140.5) internal successors, (843), 6 states have internal predecessors, (843), 0 states have call successors, (0), 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:43:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-10 23:43:18,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-10 23:43:18,586 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 23:43:18,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-10 23:43:18,590 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 23:43:18,592 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-10 23:43:19,201 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 23:43:19,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 11:43:19 BoogieIcfgContainer [2024-10-10 23:43:19,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 23:43:19,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 23:43:19,223 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 23:43:19,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 23:43:19,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 11:42:35" (3/4) ... [2024-10-10 23:43:19,226 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-10 23:43:19,255 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-10 23:43:19,257 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-10 23:43:19,259 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-10 23:43:19,261 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-10 23:43:19,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 23:43:19,464 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-10 23:43:19,464 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 23:43:19,465 INFO L158 Benchmark]: Toolchain (without parser) took 48162.47ms. Allocated memory was 167.8MB in the beginning and 1.9GB in the end (delta: 1.7GB). Free memory was 93.2MB in the beginning and 807.0MB in the end (delta: -713.8MB). Peak memory consumption was 997.4MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,465 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 167.8MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 23:43:19,465 INFO L158 Benchmark]: CACSL2BoogieTranslator took 975.83ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 89.8MB in the end (delta: 3.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,466 INFO L158 Benchmark]: Boogie Procedure Inliner took 166.01ms. Allocated memory is still 167.8MB. Free memory was 89.8MB in the beginning and 65.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,466 INFO L158 Benchmark]: Boogie Preprocessor took 427.11ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 65.8MB in the beginning and 180.5MB in the end (delta: -114.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,466 INFO L158 Benchmark]: RCFGBuilder took 2284.96ms. Allocated memory was 234.9MB in the beginning and 404.8MB in the end (delta: 169.9MB). Free memory was 180.5MB in the beginning and 333.7MB in the end (delta: -153.2MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,467 INFO L158 Benchmark]: TraceAbstraction took 44059.62ms. Allocated memory was 404.8MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 333.7MB in the beginning and 833.2MB in the end (delta: -499.5MB). Peak memory consumption was 972.6MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,467 INFO L158 Benchmark]: Witness Printer took 240.88ms. Allocated memory is still 1.9GB. Free memory was 833.2MB in the beginning and 807.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-10 23:43:19,468 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.20ms. Allocated memory is still 167.8MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 975.83ms. Allocated memory is still 167.8MB. Free memory was 93.0MB in the beginning and 89.8MB in the end (delta: 3.1MB). Peak memory consumption was 21.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 166.01ms. Allocated memory is still 167.8MB. Free memory was 89.8MB in the beginning and 65.8MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 427.11ms. Allocated memory was 167.8MB in the beginning and 234.9MB in the end (delta: 67.1MB). Free memory was 65.8MB in the beginning and 180.5MB in the end (delta: -114.7MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * RCFGBuilder took 2284.96ms. Allocated memory was 234.9MB in the beginning and 404.8MB in the end (delta: 169.9MB). Free memory was 180.5MB in the beginning and 333.7MB in the end (delta: -153.2MB). Peak memory consumption was 98.1MB. Max. memory is 16.1GB. * TraceAbstraction took 44059.62ms. Allocated memory was 404.8MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 333.7MB in the beginning and 833.2MB in the end (delta: -499.5MB). Peak memory consumption was 972.6MB. Max. memory is 16.1GB. * Witness Printer took 240.88ms. Allocated memory is still 1.9GB. Free memory was 833.2MB in the beginning and 807.0MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. 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: 125]: 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, 334 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 43.4s, OverallIterations: 16, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 17.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4012 SdHoareTripleChecker+Valid, 15.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4012 mSDsluCounter, 3726 SdHoareTripleChecker+Invalid, 12.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 98 mSDsCounter, 2224 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14549 IncrementalHoareTripleChecker+Invalid, 16773 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2224 mSolverCounterUnsat, 3628 mSDtfsCounter, 14549 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6577 GetRequests, 6536 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16124occurred in iteration=13, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 3952 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 18.4s InterpolantComputationTime, 20388 NumberOfCodeBlocks, 20388 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 20367 ConstructedInterpolants, 0 QuantifiedInterpolants, 58966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 7715 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 21 InterpolantComputations, 16 PerfectInterpolantSequences, 54051/56225 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: 1783]: Loop Invariant Derived loop invariant: ((((((((a16 <= 8) || ((a12 <= 5) && (a15 <= 3))) || ((a12 <= 7) && (a16 <= 11))) || (((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a16 != 9))) || (((a12 == 9) && (0 <= ((long long) 44 + a18))) && (a15 == 3))) || (((a15 <= 3) && (7 <= a12)) && (a16 != 9))) || (((a12 == 9) && (a16 == 9)) && (a15 != 3))) || ((a16 == 9) && (a12 <= 8))) RESULT: Ultimate proved your program to be correct! [2024-10-10 23:43:19,500 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