./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem17_label58.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem17_label58.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --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 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:53:06,175 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:53:06,178 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:53:06,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:53:06,205 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:53:06,206 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:53:06,208 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:53:06,209 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:53:06,211 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:53:06,212 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:53:06,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:53:06,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:53:06,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:53:06,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:53:06,217 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:53:06,218 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:53:06,219 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:53:06,220 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:53:06,222 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:53:06,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:53:06,225 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:53:06,235 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:53:06,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:53:06,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:53:06,241 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:53:06,241 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:53:06,242 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:53:06,243 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:53:06,243 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:53:06,244 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:53:06,245 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:53:06,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:53:06,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:53:06,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:53:06,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:53:06,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:53:06,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:53:06,254 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:53:06,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:53:06,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:53:06,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:53:06,260 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:53:06,303 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:53:06,303 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:53:06,303 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:53:06,303 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:53:06,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:53:06,304 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:53:06,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:53:06,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:53:06,305 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:53:06,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:53:06,306 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:53:06,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:53:06,310 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:53:06,310 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:53:06,310 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:53:06,310 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:53:06,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:53:06,311 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:53:06,311 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:53:06,311 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:53:06,311 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:53:06,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:53:06,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:53:06,312 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:53:06,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:53:06,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:53:06,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:53:06,313 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:53:06,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:53:06,315 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:53:06,315 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:53:06,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:53:06,315 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:53:06,316 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:53:06,316 INFO L138 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 80e930446c3b5aed0357903e7f6687fdab832b55b1199711672275ec34cd4ed8 [2022-11-25 15:53:06,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:53:06,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:53:06,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:53:06,642 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:53:06,642 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:53:06,644 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2022-11-25 15:53:09,678 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:53:10,271 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:53:10,272 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/sv-benchmarks/c/eca-rers2012/Problem17_label58.c [2022-11-25 15:53:10,305 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/data/51134df5d/18785467ea3b42509d58122129b7680d/FLAG2dc6e76af [2022-11-25 15:53:10,324 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/data/51134df5d/18785467ea3b42509d58122129b7680d [2022-11-25 15:53:10,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:53:10,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:53:10,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:53:10,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:53:10,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:53:10,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:53:10" (1/1) ... [2022-11-25 15:53:10,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c8551df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:10, skipping insertion in model container [2022-11-25 15:53:10,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:53:10" (1/1) ... [2022-11-25 15:53:10,347 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:53:10,446 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:53:10,735 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/sv-benchmarks/c/eca-rers2012/Problem17_label58.c[6741,6754] [2022-11-25 15:53:11,494 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:53:11,505 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:53:11,530 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/sv-benchmarks/c/eca-rers2012/Problem17_label58.c[6741,6754] [2022-11-25 15:53:12,022 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:53:12,040 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:53:12,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12 WrapperNode [2022-11-25 15:53:12,041 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:53:12,043 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:53:12,043 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:53:12,043 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:53:12,050 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,110 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,402 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2611 [2022-11-25 15:53:12,402 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:53:12,403 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:53:12,403 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:53:12,403 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:53:12,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,684 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,711 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,752 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,825 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:53:12,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:53:12,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:53:12,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:53:12,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (1/1) ... [2022-11-25 15:53:12,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:53:12,849 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:53:12,866 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:53:12,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:53:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:53:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:53:12,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:53:12,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:53:13,003 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:53:13,006 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:53:17,007 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:53:17,018 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:53:17,018 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 15:53:17,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:53:17 BoogieIcfgContainer [2022-11-25 15:53:17,022 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:53:17,024 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:53:17,024 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:53:17,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:53:17,028 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:53:10" (1/3) ... [2022-11-25 15:53:17,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:53:17, skipping insertion in model container [2022-11-25 15:53:17,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:53:12" (2/3) ... [2022-11-25 15:53:17,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15bd02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:53:17, skipping insertion in model container [2022-11-25 15:53:17,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:53:17" (3/3) ... [2022-11-25 15:53:17,031 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label58.c [2022-11-25 15:53:17,049 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:53:17,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 15:53:17,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:53:17,117 INFO L357 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@257d5460, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:53:17,118 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 15:53:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:17,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 15:53:17,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:17,133 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:17,133 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:17,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:17,139 INFO L85 PathProgramCache]: Analyzing trace with hash -2068820151, now seen corresponding path program 1 times [2022-11-25 15:53:17,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:17,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003621023] [2022-11-25 15:53:17,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:17,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:17,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:17,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:17,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003621023] [2022-11-25 15:53:17,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003621023] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:17,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:17,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:53:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106083423] [2022-11-25 15:53:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:17,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:17,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:17,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:17,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:17,603 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:21,667 INFO L93 Difference]: Finished difference Result 1667 states and 3061 transitions. [2022-11-25 15:53:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:21,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 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 45 [2022-11-25 15:53:21,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:21,709 INFO L225 Difference]: With dead ends: 1667 [2022-11-25 15:53:21,709 INFO L226 Difference]: Without dead ends: 998 [2022-11-25 15:53:21,719 INFO L412 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 [2022-11-25 15:53:21,723 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 500 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:21,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-25 15:53:21,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2022-11-25 15:53:21,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2022-11-25 15:53:21,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:21,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2022-11-25 15:53:21,821 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 45 [2022-11-25 15:53:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:21,822 INFO L495 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2022-11-25 15:53:21,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 2 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:21,822 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2022-11-25 15:53:21,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-11-25 15:53:21,825 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:21,825 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:21,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:53:21,826 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:21,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1676282541, now seen corresponding path program 1 times [2022-11-25 15:53:21,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:21,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039415748] [2022-11-25 15:53:21,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:21,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:22,034 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:22,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:22,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039415748] [2022-11-25 15:53:22,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039415748] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:22,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:22,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:53:22,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165695468] [2022-11-25 15:53:22,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:22,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:22,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:22,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:22,039 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:25,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:25,384 INFO L93 Difference]: Finished difference Result 2843 states and 4882 transitions. [2022-11-25 15:53:25,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:25,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2022-11-25 15:53:25,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:25,392 INFO L225 Difference]: With dead ends: 2843 [2022-11-25 15:53:25,392 INFO L226 Difference]: Without dead ends: 1863 [2022-11-25 15:53:25,394 INFO L412 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 [2022-11-25 15:53:25,396 INFO L413 NwaCegarLoop]: 422 mSDtfsCounter, 409 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1341 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 1341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:25,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 495 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 1341 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-25 15:53:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2022-11-25 15:53:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1857. [2022-11-25 15:53:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1856 states have (on average 1.4552801724137931) internal successors, (2701), 1856 states have internal predecessors, (2701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:25,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2701 transitions. [2022-11-25 15:53:25,487 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2701 transitions. Word has length 110 [2022-11-25 15:53:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:25,490 INFO L495 AbstractCegarLoop]: Abstraction has 1857 states and 2701 transitions. [2022-11-25 15:53:25,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2701 transitions. [2022-11-25 15:53:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-11-25 15:53:25,502 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:25,505 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:25,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:53:25,506 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:25,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash -690077156, now seen corresponding path program 1 times [2022-11-25 15:53:25,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:25,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068218073] [2022-11-25 15:53:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:25,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:25,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:25,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068218073] [2022-11-25 15:53:25,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068218073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:25,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:25,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:53:25,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983376371] [2022-11-25 15:53:25,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:25,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:25,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:25,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:25,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:25,857 INFO L87 Difference]: Start difference. First operand 1857 states and 2701 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:28,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:28,706 INFO L93 Difference]: Finished difference Result 5425 states and 7895 transitions. [2022-11-25 15:53:28,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:28,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2022-11-25 15:53:28,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:28,718 INFO L225 Difference]: With dead ends: 5425 [2022-11-25 15:53:28,718 INFO L226 Difference]: Without dead ends: 3570 [2022-11-25 15:53:28,720 INFO L412 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 [2022-11-25 15:53:28,722 INFO L413 NwaCegarLoop]: 516 mSDtfsCounter, 387 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:28,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-25 15:53:28,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2022-11-25 15:53:28,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 2714. [2022-11-25 15:53:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2714 states, 2713 states have (on average 1.315886472539624) internal successors, (3570), 2713 states have internal predecessors, (3570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:28,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3570 transitions. [2022-11-25 15:53:28,787 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3570 transitions. Word has length 116 [2022-11-25 15:53:28,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:28,788 INFO L495 AbstractCegarLoop]: Abstraction has 2714 states and 3570 transitions. [2022-11-25 15:53:28,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:28,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3570 transitions. [2022-11-25 15:53:28,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-11-25 15:53:28,791 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:28,791 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 15:53:28,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:53:28,792 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:28,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash 544079772, now seen corresponding path program 1 times [2022-11-25 15:53:28,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:28,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323636838] [2022-11-25 15:53:28,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:28,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:29,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323636838] [2022-11-25 15:53:29,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323636838] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:29,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:29,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:53:29,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259892959] [2022-11-25 15:53:29,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:29,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:53:29,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:53:29,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:53:29,422 INFO L87 Difference]: Start difference. First operand 2714 states and 3570 transitions. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:32,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:32,955 INFO L93 Difference]: Finished difference Result 7159 states and 9653 transitions. [2022-11-25 15:53:32,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:53:32,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 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 193 [2022-11-25 15:53:32,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:32,971 INFO L225 Difference]: With dead ends: 7159 [2022-11-25 15:53:32,972 INFO L226 Difference]: Without dead ends: 4447 [2022-11-25 15:53:32,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:53:32,986 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 1657 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1773 mSolverCounterSat, 978 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1657 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 2751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 978 IncrementalHoareTripleChecker+Valid, 1773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:32,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1657 Valid, 843 Invalid, 2751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [978 Valid, 1773 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-25 15:53:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4447 states. [2022-11-25 15:53:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4447 to 4424. [2022-11-25 15:53:33,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4424 states, 4423 states have (on average 1.2912050644359032) internal successors, (5711), 4423 states have internal predecessors, (5711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4424 states to 4424 states and 5711 transitions. [2022-11-25 15:53:33,085 INFO L78 Accepts]: Start accepts. Automaton has 4424 states and 5711 transitions. Word has length 193 [2022-11-25 15:53:33,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:33,087 INFO L495 AbstractCegarLoop]: Abstraction has 4424 states and 5711 transitions. [2022-11-25 15:53:33,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:33,088 INFO L276 IsEmpty]: Start isEmpty. Operand 4424 states and 5711 transitions. [2022-11-25 15:53:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-11-25 15:53:33,094 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:33,094 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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] [2022-11-25 15:53:33,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:53:33,094 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:33,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:33,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1198749749, now seen corresponding path program 1 times [2022-11-25 15:53:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:33,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3368317] [2022-11-25 15:53:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:33,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2022-11-25 15:53:33,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:33,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3368317] [2022-11-25 15:53:33,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3368317] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:33,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:33,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:53:33,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998967945] [2022-11-25 15:53:33,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:33,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:33,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:33,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:33,535 INFO L87 Difference]: Start difference. First operand 4424 states and 5711 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:36,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:36,930 INFO L93 Difference]: Finished difference Result 10593 states and 13804 transitions. [2022-11-25 15:53:36,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:36,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2022-11-25 15:53:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:36,964 INFO L225 Difference]: With dead ends: 10593 [2022-11-25 15:53:36,965 INFO L226 Difference]: Without dead ends: 6171 [2022-11-25 15:53:36,969 INFO L412 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 [2022-11-25 15:53:36,970 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 508 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1459 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 508 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 1942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 1459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:36,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [508 Valid, 240 Invalid, 1942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 1459 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-25 15:53:36,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2022-11-25 15:53:37,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 6153. [2022-11-25 15:53:37,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6153 states, 6152 states have (on average 1.303966189856957) internal successors, (8022), 6152 states have internal predecessors, (8022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:37,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6153 states to 6153 states and 8022 transitions. [2022-11-25 15:53:37,131 INFO L78 Accepts]: Start accepts. Automaton has 6153 states and 8022 transitions. Word has length 199 [2022-11-25 15:53:37,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:37,135 INFO L495 AbstractCegarLoop]: Abstraction has 6153 states and 8022 transitions. [2022-11-25 15:53:37,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 6153 states and 8022 transitions. [2022-11-25 15:53:37,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2022-11-25 15:53:37,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:37,143 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:37,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:53:37,144 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:37,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:37,144 INFO L85 PathProgramCache]: Analyzing trace with hash -654017339, now seen corresponding path program 1 times [2022-11-25 15:53:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:37,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31961043] [2022-11-25 15:53:37,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:37,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:37,785 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:37,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31961043] [2022-11-25 15:53:37,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31961043] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:53:37,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388709038] [2022-11-25 15:53:37,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:37,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:53:37,787 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:53:37,793 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:53:37,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 15:53:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:37,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-25 15:53:37,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:53:38,437 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:38,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:53:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:53:38,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388709038] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 15:53:38,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 15:53:38,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2022-11-25 15:53:38,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174849876] [2022-11-25 15:53:38,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:38,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:53:38,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:38,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:53:38,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:53:38,976 INFO L87 Difference]: Start difference. First operand 6153 states and 8022 transitions. Second operand has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:44,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:44,271 INFO L93 Difference]: Finished difference Result 19997 states and 26780 transitions. [2022-11-25 15:53:44,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:53:44,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 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 265 [2022-11-25 15:53:44,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:44,312 INFO L225 Difference]: With dead ends: 19997 [2022-11-25 15:53:44,313 INFO L226 Difference]: Without dead ends: 12537 [2022-11-25 15:53:44,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 531 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:53:44,321 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 1055 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1055 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 3688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1395 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:44,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1055 Valid, 153 Invalid, 3688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1395 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-11-25 15:53:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12537 states. [2022-11-25 15:53:44,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12537 to 12531. [2022-11-25 15:53:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12531 states, 12530 states have (on average 1.2289704708699123) internal successors, (15399), 12530 states have internal predecessors, (15399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:44,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12531 states to 12531 states and 15399 transitions. [2022-11-25 15:53:44,564 INFO L78 Accepts]: Start accepts. Automaton has 12531 states and 15399 transitions. Word has length 265 [2022-11-25 15:53:44,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:44,565 INFO L495 AbstractCegarLoop]: Abstraction has 12531 states and 15399 transitions. [2022-11-25 15:53:44,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 66.25) internal successors, (265), 3 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 12531 states and 15399 transitions. [2022-11-25 15:53:44,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2022-11-25 15:53:44,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:44,572 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:44,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 15:53:44,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 15:53:44,793 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:44,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:44,793 INFO L85 PathProgramCache]: Analyzing trace with hash -925800976, now seen corresponding path program 1 times [2022-11-25 15:53:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:44,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689046677] [2022-11-25 15:53:44,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:45,194 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-25 15:53:45,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:45,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689046677] [2022-11-25 15:53:45,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689046677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:45,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:45,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:53:45,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720114969] [2022-11-25 15:53:45,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:45,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:45,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:45,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:45,197 INFO L87 Difference]: Start difference. First operand 12531 states and 15399 transitions. Second operand has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:47,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:47,998 INFO L93 Difference]: Finished difference Result 30195 states and 36859 transitions. [2022-11-25 15:53:47,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:47,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 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 302 [2022-11-25 15:53:47,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:48,030 INFO L225 Difference]: With dead ends: 30195 [2022-11-25 15:53:48,031 INFO L226 Difference]: Without dead ends: 16816 [2022-11-25 15:53:48,043 INFO L412 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 [2022-11-25 15:53:48,044 INFO L413 NwaCegarLoop]: 791 mSDtfsCounter, 413 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:48,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 859 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 15:53:48,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16816 states. [2022-11-25 15:53:48,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16816 to 16805. [2022-11-25 15:53:48,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16805 states, 16804 states have (on average 1.1906688883599144) internal successors, (20008), 16804 states have internal predecessors, (20008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:48,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16805 states to 16805 states and 20008 transitions. [2022-11-25 15:53:48,320 INFO L78 Accepts]: Start accepts. Automaton has 16805 states and 20008 transitions. Word has length 302 [2022-11-25 15:53:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:48,321 INFO L495 AbstractCegarLoop]: Abstraction has 16805 states and 20008 transitions. [2022-11-25 15:53:48,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.66666666666667) internal successors, (221), 3 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 16805 states and 20008 transitions. [2022-11-25 15:53:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2022-11-25 15:53:48,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:48,331 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:48,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:53:48,332 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1794999384, now seen corresponding path program 1 times [2022-11-25 15:53:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:48,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620725698] [2022-11-25 15:53:48,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:48,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:48,968 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-25 15:53:48,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:48,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620725698] [2022-11-25 15:53:48,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620725698] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:48,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:48,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:53:48,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742823460] [2022-11-25 15:53:48,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:48,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:48,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:48,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:48,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:48,973 INFO L87 Difference]: Start difference. First operand 16805 states and 20008 transitions. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:51,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:51,754 INFO L93 Difference]: Finished difference Result 40835 states and 48524 transitions. [2022-11-25 15:53:51,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:51,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 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 348 [2022-11-25 15:53:51,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:51,794 INFO L225 Difference]: With dead ends: 40835 [2022-11-25 15:53:51,794 INFO L226 Difference]: Without dead ends: 21900 [2022-11-25 15:53:51,807 INFO L412 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 [2022-11-25 15:53:51,809 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 374 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 1402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:51,809 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 810 Invalid, 1402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 15:53:51,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21900 states. [2022-11-25 15:53:52,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21900 to 21894. [2022-11-25 15:53:52,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21894 states, 21893 states have (on average 1.1318229571095784) internal successors, (24779), 21893 states have internal predecessors, (24779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21894 states to 21894 states and 24779 transitions. [2022-11-25 15:53:52,123 INFO L78 Accepts]: Start accepts. Automaton has 21894 states and 24779 transitions. Word has length 348 [2022-11-25 15:53:52,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:52,123 INFO L495 AbstractCegarLoop]: Abstraction has 21894 states and 24779 transitions. [2022-11-25 15:53:52,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 21894 states and 24779 transitions. [2022-11-25 15:53:52,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2022-11-25 15:53:52,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:52,136 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:52,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:53:52,137 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:52,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:52,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1446279023, now seen corresponding path program 1 times [2022-11-25 15:53:52,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:52,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830572860] [2022-11-25 15:53:52,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:52,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:52,572 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-25 15:53:52,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830572860] [2022-11-25 15:53:52,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830572860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:52,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:52,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:53:52,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989229592] [2022-11-25 15:53:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:52,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:52,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:52,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:52,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:52,576 INFO L87 Difference]: Start difference. First operand 21894 states and 24779 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:55,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:55,001 INFO L93 Difference]: Finished difference Result 48460 states and 55073 transitions. [2022-11-25 15:53:55,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 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 373 [2022-11-25 15:53:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:55,047 INFO L225 Difference]: With dead ends: 48460 [2022-11-25 15:53:55,047 INFO L226 Difference]: Without dead ends: 26568 [2022-11-25 15:53:55,063 INFO L412 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 [2022-11-25 15:53:55,064 INFO L413 NwaCegarLoop]: 729 mSDtfsCounter, 369 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:55,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 790 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 15:53:55,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26568 states. [2022-11-25 15:53:55,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26568 to 26568. [2022-11-25 15:53:55,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26568 states, 26567 states have (on average 1.1179658975420634) internal successors, (29701), 26567 states have internal predecessors, (29701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:55,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26568 states to 26568 states and 29701 transitions. [2022-11-25 15:53:55,427 INFO L78 Accepts]: Start accepts. Automaton has 26568 states and 29701 transitions. Word has length 373 [2022-11-25 15:53:55,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:55,427 INFO L495 AbstractCegarLoop]: Abstraction has 26568 states and 29701 transitions. [2022-11-25 15:53:55,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 26568 states and 29701 transitions. [2022-11-25 15:53:55,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2022-11-25 15:53:55,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:55,494 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:55,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:53:55,494 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1440550631, now seen corresponding path program 1 times [2022-11-25 15:53:55,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:55,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879859950] [2022-11-25 15:53:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 284 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2022-11-25 15:53:56,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:56,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879859950] [2022-11-25 15:53:56,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879859950] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:56,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:56,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:53:56,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469643149] [2022-11-25 15:53:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:56,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:56,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:56,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:56,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:56,040 INFO L87 Difference]: Start difference. First operand 26568 states and 29701 transitions. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:58,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:53:58,567 INFO L93 Difference]: Finished difference Result 64200 states and 72104 transitions. [2022-11-25 15:53:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:53:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 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 383 [2022-11-25 15:53:58,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:53:58,625 INFO L225 Difference]: With dead ends: 64200 [2022-11-25 15:53:58,625 INFO L226 Difference]: Without dead ends: 35082 [2022-11-25 15:53:58,641 INFO L412 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 [2022-11-25 15:53:58,641 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 288 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 742 SdHoareTripleChecker+Invalid, 1367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:53:58,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 742 Invalid, 1367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 15:53:58,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35082 states. [2022-11-25 15:53:58,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35082 to 29531. [2022-11-25 15:53:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29531 states, 29530 states have (on average 1.1009820521503555) internal successors, (32512), 29530 states have internal predecessors, (32512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29531 states to 29531 states and 32512 transitions. [2022-11-25 15:53:59,060 INFO L78 Accepts]: Start accepts. Automaton has 29531 states and 32512 transitions. Word has length 383 [2022-11-25 15:53:59,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:53:59,061 INFO L495 AbstractCegarLoop]: Abstraction has 29531 states and 32512 transitions. [2022-11-25 15:53:59,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:53:59,061 INFO L276 IsEmpty]: Start isEmpty. Operand 29531 states and 32512 transitions. [2022-11-25 15:53:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2022-11-25 15:53:59,074 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:53:59,075 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:53:59,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:53:59,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:53:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:53:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1027671709, now seen corresponding path program 1 times [2022-11-25 15:53:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:53:59,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932366030] [2022-11-25 15:53:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:53:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:53:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:53:59,573 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2022-11-25 15:53:59,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:53:59,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932366030] [2022-11-25 15:53:59,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932366030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:53:59,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:53:59,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:53:59,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736278325] [2022-11-25 15:53:59,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:53:59,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:53:59,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:53:59,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:53:59,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:53:59,576 INFO L87 Difference]: Start difference. First operand 29531 states and 32512 transitions. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:02,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:02,288 INFO L93 Difference]: Finished difference Result 67601 states and 74480 transitions. [2022-11-25 15:54:02,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:02,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 408 [2022-11-25 15:54:02,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:02,339 INFO L225 Difference]: With dead ends: 67601 [2022-11-25 15:54:02,339 INFO L226 Difference]: Without dead ends: 38072 [2022-11-25 15:54:02,357 INFO L412 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 [2022-11-25 15:54:02,358 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 466 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:02,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 169 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-25 15:54:02,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38072 states. [2022-11-25 15:54:02,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38072 to 29954. [2022-11-25 15:54:02,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29954 states, 29953 states have (on average 1.100557540146229) internal successors, (32965), 29953 states have internal predecessors, (32965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:02,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29954 states to 29954 states and 32965 transitions. [2022-11-25 15:54:02,946 INFO L78 Accepts]: Start accepts. Automaton has 29954 states and 32965 transitions. Word has length 408 [2022-11-25 15:54:02,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:02,947 INFO L495 AbstractCegarLoop]: Abstraction has 29954 states and 32965 transitions. [2022-11-25 15:54:02,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:02,947 INFO L276 IsEmpty]: Start isEmpty. Operand 29954 states and 32965 transitions. [2022-11-25 15:54:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2022-11-25 15:54:02,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:02,973 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:02,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:54:02,973 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:02,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:02,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1665160821, now seen corresponding path program 1 times [2022-11-25 15:54:02,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:02,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210974578] [2022-11-25 15:54:02,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:02,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:03,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:04,085 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:54:04,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:04,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210974578] [2022-11-25 15:54:04,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210974578] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 15:54:04,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717743083] [2022-11-25 15:54:04,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:04,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:54:04,086 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:54:04,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 15:54:04,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 15:54:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:04,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 15:54:04,354 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 15:54:05,479 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 118 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:54:05,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 15:54:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 316 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:54:06,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717743083] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 15:54:06,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 15:54:06,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-25 15:54:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660834279] [2022-11-25 15:54:06,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 15:54:06,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 15:54:06,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:06,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 15:54:06,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:54:06,447 INFO L87 Difference]: Start difference. First operand 29954 states and 32965 transitions. Second operand has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:15,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:15,890 INFO L93 Difference]: Finished difference Result 88887 states and 97579 transitions. [2022-11-25 15:54:15,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:54:15,890 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 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 519 [2022-11-25 15:54:15,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:15,966 INFO L225 Difference]: With dead ends: 88887 [2022-11-25 15:54:15,966 INFO L226 Difference]: Without dead ends: 57660 [2022-11-25 15:54:15,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1041 GetRequests, 1031 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2022-11-25 15:54:15,985 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 2907 mSDsluCounter, 328 mSDsCounter, 0 mSdLazyCounter, 7838 mSolverCounterSat, 1121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2907 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 8959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1121 IncrementalHoareTripleChecker+Valid, 7838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:15,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2907 Valid, 430 Invalid, 8959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1121 Valid, 7838 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-25 15:54:16,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57660 states. [2022-11-25 15:54:16,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57660 to 36362. [2022-11-25 15:54:16,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36362 states, 36361 states have (on average 1.0971920464233658) internal successors, (39895), 36361 states have internal predecessors, (39895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:16,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36362 states to 36362 states and 39895 transitions. [2022-11-25 15:54:16,617 INFO L78 Accepts]: Start accepts. Automaton has 36362 states and 39895 transitions. Word has length 519 [2022-11-25 15:54:16,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:16,617 INFO L495 AbstractCegarLoop]: Abstraction has 36362 states and 39895 transitions. [2022-11-25 15:54:16,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.7) internal successors, (1037), 9 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:16,618 INFO L276 IsEmpty]: Start isEmpty. Operand 36362 states and 39895 transitions. [2022-11-25 15:54:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2022-11-25 15:54:16,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:16,642 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:16,656 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-25 15:54:16,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38267df2-d584-4f54-a7f8-56ae57e648d4/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 15:54:16,849 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:16,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:16,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1435012347, now seen corresponding path program 1 times [2022-11-25 15:54:16,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:16,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443763421] [2022-11-25 15:54:16,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:16,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:17,502 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-25 15:54:17,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:17,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443763421] [2022-11-25 15:54:17,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443763421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:17,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:17,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:54:17,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078712303] [2022-11-25 15:54:17,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:17,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:17,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:17,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:17,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:17,506 INFO L87 Difference]: Start difference. First operand 36362 states and 39895 transitions. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:19,126 INFO L93 Difference]: Finished difference Result 71439 states and 78401 transitions. [2022-11-25 15:54:19,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:19,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 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 635 [2022-11-25 15:54:19,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:19,163 INFO L225 Difference]: With dead ends: 71439 [2022-11-25 15:54:19,163 INFO L226 Difference]: Without dead ends: 35503 [2022-11-25 15:54:19,177 INFO L412 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 [2022-11-25 15:54:19,178 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 413 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 637 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:19,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 104 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 637 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-25 15:54:19,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35503 states. [2022-11-25 15:54:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35503 to 35497. [2022-11-25 15:54:19,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35497 states, 35496 states have (on average 1.0962361956276763) internal successors, (38912), 35496 states have internal predecessors, (38912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35497 states to 35497 states and 38912 transitions. [2022-11-25 15:54:19,617 INFO L78 Accepts]: Start accepts. Automaton has 35497 states and 38912 transitions. Word has length 635 [2022-11-25 15:54:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:19,617 INFO L495 AbstractCegarLoop]: Abstraction has 35497 states and 38912 transitions. [2022-11-25 15:54:19,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 2 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 35497 states and 38912 transitions. [2022-11-25 15:54:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 662 [2022-11-25 15:54:19,638 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:19,638 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:19,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:54:19,639 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:19,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1650487390, now seen corresponding path program 1 times [2022-11-25 15:54:19,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:19,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247164933] [2022-11-25 15:54:19,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:19,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 352 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-11-25 15:54:20,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:20,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247164933] [2022-11-25 15:54:20,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247164933] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:20,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:20,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:54:20,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629783498] [2022-11-25 15:54:20,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:20,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:20,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:20,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:20,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:20,235 INFO L87 Difference]: Start difference. First operand 35497 states and 38912 transitions. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:22,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:22,770 INFO L93 Difference]: Finished difference Result 80344 states and 88597 transitions. [2022-11-25 15:54:22,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:22,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 661 [2022-11-25 15:54:22,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:22,808 INFO L225 Difference]: With dead ends: 80344 [2022-11-25 15:54:22,808 INFO L226 Difference]: Without dead ends: 45274 [2022-11-25 15:54:22,828 INFO L412 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 [2022-11-25 15:54:22,829 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 439 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:22,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 362 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 15:54:22,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45274 states. [2022-11-25 15:54:23,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45274 to 42720. [2022-11-25 15:54:23,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42720 states, 42719 states have (on average 1.0914113158079544) internal successors, (46624), 42719 states have internal predecessors, (46624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:23,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42720 states to 42720 states and 46624 transitions. [2022-11-25 15:54:23,570 INFO L78 Accepts]: Start accepts. Automaton has 42720 states and 46624 transitions. Word has length 661 [2022-11-25 15:54:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:23,571 INFO L495 AbstractCegarLoop]: Abstraction has 42720 states and 46624 transitions. [2022-11-25 15:54:23,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:23,571 INFO L276 IsEmpty]: Start isEmpty. Operand 42720 states and 46624 transitions. [2022-11-25 15:54:23,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 699 [2022-11-25 15:54:23,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:23,599 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:23,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:54:23,599 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:23,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:23,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1090791905, now seen corresponding path program 1 times [2022-11-25 15:54:23,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:23,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371869238] [2022-11-25 15:54:23,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:23,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:23,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1002 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2022-11-25 15:54:24,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:24,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371869238] [2022-11-25 15:54:24,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371869238] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:24,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:24,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:54:24,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005297591] [2022-11-25 15:54:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:24,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:54:24,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:24,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:54:24,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:54:24,870 INFO L87 Difference]: Start difference. First operand 42720 states and 46624 transitions. Second operand has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:28,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:28,649 INFO L93 Difference]: Finished difference Result 102929 states and 112737 transitions. [2022-11-25 15:54:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:54:28,649 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 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 698 [2022-11-25 15:54:28,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:28,703 INFO L225 Difference]: With dead ends: 102929 [2022-11-25 15:54:28,704 INFO L226 Difference]: Without dead ends: 60636 [2022-11-25 15:54:28,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:54:28,725 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 825 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 2270 mSolverCounterSat, 403 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 403 IncrementalHoareTripleChecker+Valid, 2270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:28,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 180 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [403 Valid, 2270 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-11-25 15:54:28,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60636 states. [2022-11-25 15:54:29,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60636 to 56374. [2022-11-25 15:54:29,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56374 states, 56373 states have (on average 1.100172068188672) internal successors, (62020), 56373 states have internal predecessors, (62020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:29,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56374 states to 56374 states and 62020 transitions. [2022-11-25 15:54:29,518 INFO L78 Accepts]: Start accepts. Automaton has 56374 states and 62020 transitions. Word has length 698 [2022-11-25 15:54:29,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:29,518 INFO L495 AbstractCegarLoop]: Abstraction has 56374 states and 62020 transitions. [2022-11-25 15:54:29,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 56374 states and 62020 transitions. [2022-11-25 15:54:29,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2022-11-25 15:54:29,535 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:29,536 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:29,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:54:29,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:29,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:29,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1339675404, now seen corresponding path program 1 times [2022-11-25 15:54:29,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:29,537 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234148192] [2022-11-25 15:54:29,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:29,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:30,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1020 backedges. 778 proven. 0 refuted. 0 times theorem prover too weak. 242 trivial. 0 not checked. [2022-11-25 15:54:30,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:30,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234148192] [2022-11-25 15:54:30,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234148192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:30,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:30,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:54:30,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266486367] [2022-11-25 15:54:30,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:30,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:30,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:30,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:30,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:30,326 INFO L87 Difference]: Start difference. First operand 56374 states and 62020 transitions. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:33,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:33,129 INFO L93 Difference]: Finished difference Result 124676 states and 137552 transitions. [2022-11-25 15:54:33,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:33,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 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 699 [2022-11-25 15:54:33,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:33,194 INFO L225 Difference]: With dead ends: 124676 [2022-11-25 15:54:33,194 INFO L226 Difference]: Without dead ends: 66171 [2022-11-25 15:54:33,219 INFO L412 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 [2022-11-25 15:54:33,219 INFO L413 NwaCegarLoop]: 558 mSDtfsCounter, 431 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:33,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 594 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-11-25 15:54:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66171 states. [2022-11-25 15:54:34,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66171 to 64461. [2022-11-25 15:54:34,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64461 states, 64460 states have (on average 1.099922432516289) internal successors, (70901), 64460 states have internal predecessors, (70901), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:34,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64461 states to 64461 states and 70901 transitions. [2022-11-25 15:54:34,313 INFO L78 Accepts]: Start accepts. Automaton has 64461 states and 70901 transitions. Word has length 699 [2022-11-25 15:54:34,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:34,313 INFO L495 AbstractCegarLoop]: Abstraction has 64461 states and 70901 transitions. [2022-11-25 15:54:34,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:34,313 INFO L276 IsEmpty]: Start isEmpty. Operand 64461 states and 70901 transitions. [2022-11-25 15:54:34,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2022-11-25 15:54:34,336 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:34,337 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:34,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:54:34,337 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:34,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:34,338 INFO L85 PathProgramCache]: Analyzing trace with hash 448649391, now seen corresponding path program 1 times [2022-11-25 15:54:34,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:34,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072564272] [2022-11-25 15:54:34,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:34,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:34,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:35,907 INFO L134 CoverageAnalysis]: Checked inductivity of 1022 backedges. 750 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2022-11-25 15:54:35,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:35,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072564272] [2022-11-25 15:54:35,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072564272] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:35,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:35,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:54:35,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325395893] [2022-11-25 15:54:35,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:35,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:35,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:35,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:35,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:35,911 INFO L87 Difference]: Start difference. First operand 64461 states and 70901 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:38,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:38,245 INFO L93 Difference]: Finished difference Result 131048 states and 144049 transitions. [2022-11-25 15:54:38,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:38,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 718 [2022-11-25 15:54:38,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:38,306 INFO L225 Difference]: With dead ends: 131048 [2022-11-25 15:54:38,306 INFO L226 Difference]: Without dead ends: 67014 [2022-11-25 15:54:38,337 INFO L412 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 [2022-11-25 15:54:38,338 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 114 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:38,338 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 781 Invalid, 1157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 15:54:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67014 states. [2022-11-25 15:54:39,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67014 to 66586. [2022-11-25 15:54:39,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66586 states, 66585 states have (on average 1.0968386273184652) internal successors, (73033), 66585 states have internal predecessors, (73033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66586 states to 66586 states and 73033 transitions. [2022-11-25 15:54:39,271 INFO L78 Accepts]: Start accepts. Automaton has 66586 states and 73033 transitions. Word has length 718 [2022-11-25 15:54:39,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:39,271 INFO L495 AbstractCegarLoop]: Abstraction has 66586 states and 73033 transitions. [2022-11-25 15:54:39,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 66586 states and 73033 transitions. [2022-11-25 15:54:39,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2022-11-25 15:54:39,474 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:39,476 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:39,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:54:39,476 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:39,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:39,477 INFO L85 PathProgramCache]: Analyzing trace with hash 345824951, now seen corresponding path program 1 times [2022-11-25 15:54:39,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:39,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502667502] [2022-11-25 15:54:39,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:39,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:40,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2022-11-25 15:54:40,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:40,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502667502] [2022-11-25 15:54:40,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502667502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:40,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:40,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:54:40,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311378532] [2022-11-25 15:54:40,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:40,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:40,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:40,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:40,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:40,317 INFO L87 Difference]: Start difference. First operand 66586 states and 73033 transitions. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:43,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:43,051 INFO L93 Difference]: Finished difference Result 151464 states and 166277 transitions. [2022-11-25 15:54:43,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:43,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 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 722 [2022-11-25 15:54:43,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:43,129 INFO L225 Difference]: With dead ends: 151464 [2022-11-25 15:54:43,129 INFO L226 Difference]: Without dead ends: 85305 [2022-11-25 15:54:43,150 INFO L412 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 [2022-11-25 15:54:43,150 INFO L413 NwaCegarLoop]: 227 mSDtfsCounter, 396 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:43,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 264 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-25 15:54:43,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85305 states. [2022-11-25 15:54:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85305 to 82324. [2022-11-25 15:54:44,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82324 states, 82323 states have (on average 1.089731909672874) internal successors, (89710), 82323 states have internal predecessors, (89710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:44,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82324 states to 82324 states and 89710 transitions. [2022-11-25 15:54:44,219 INFO L78 Accepts]: Start accepts. Automaton has 82324 states and 89710 transitions. Word has length 722 [2022-11-25 15:54:44,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:44,219 INFO L495 AbstractCegarLoop]: Abstraction has 82324 states and 89710 transitions. [2022-11-25 15:54:44,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:44,219 INFO L276 IsEmpty]: Start isEmpty. Operand 82324 states and 89710 transitions. [2022-11-25 15:54:44,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2022-11-25 15:54:44,244 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:44,244 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:44,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 15:54:44,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:44,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:44,245 INFO L85 PathProgramCache]: Analyzing trace with hash -152065236, now seen corresponding path program 1 times [2022-11-25 15:54:44,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:44,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799204767] [2022-11-25 15:54:44,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:44,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:44,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1100 backedges. 785 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2022-11-25 15:54:45,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:45,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799204767] [2022-11-25 15:54:45,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799204767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:45,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:45,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:54:45,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138752646] [2022-11-25 15:54:45,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:45,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:45,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:45,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:45,656 INFO L87 Difference]: Start difference. First operand 82324 states and 89710 transitions. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:48,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:48,071 INFO L93 Difference]: Finished difference Result 168472 states and 183279 transitions. [2022-11-25 15:54:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 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 752 [2022-11-25 15:54:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:48,153 INFO L225 Difference]: With dead ends: 168472 [2022-11-25 15:54:48,153 INFO L226 Difference]: Without dead ends: 86575 [2022-11-25 15:54:48,183 INFO L412 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 [2022-11-25 15:54:48,184 INFO L413 NwaCegarLoop]: 700 mSDtfsCounter, 126 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:48,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 745 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 15:54:48,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86575 states. [2022-11-25 15:54:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86575 to 86572. [2022-11-25 15:54:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86572 states, 86571 states have (on average 1.0804426424553257) internal successors, (93535), 86571 states have internal predecessors, (93535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:49,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86572 states to 86572 states and 93535 transitions. [2022-11-25 15:54:49,408 INFO L78 Accepts]: Start accepts. Automaton has 86572 states and 93535 transitions. Word has length 752 [2022-11-25 15:54:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:49,409 INFO L495 AbstractCegarLoop]: Abstraction has 86572 states and 93535 transitions. [2022-11-25 15:54:49,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:49,409 INFO L276 IsEmpty]: Start isEmpty. Operand 86572 states and 93535 transitions. [2022-11-25 15:54:49,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2022-11-25 15:54:49,459 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:49,460 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:54:49,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 15:54:49,460 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:49,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:49,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1102994304, now seen corresponding path program 1 times [2022-11-25 15:54:49,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:49,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552243413] [2022-11-25 15:54:49,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:49,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:50,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1835 backedges. 841 proven. 0 refuted. 0 times theorem prover too weak. 994 trivial. 0 not checked. [2022-11-25 15:54:50,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:50,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552243413] [2022-11-25 15:54:50,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552243413] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:50,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:50,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:54:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889071536] [2022-11-25 15:54:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:50,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:54:50,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:50,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:54:50,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:54:50,388 INFO L87 Difference]: Start difference. First operand 86572 states and 93535 transitions. Second operand has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:52,888 INFO L93 Difference]: Finished difference Result 173978 states and 187714 transitions. [2022-11-25 15:54:52,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:54:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 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 1038 [2022-11-25 15:54:52,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:52,973 INFO L225 Difference]: With dead ends: 173978 [2022-11-25 15:54:52,973 INFO L226 Difference]: Without dead ends: 87832 [2022-11-25 15:54:53,006 INFO L412 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 [2022-11-25 15:54:53,006 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 450 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 1200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:53,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 320 Invalid, 1200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 15:54:53,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87832 states. [2022-11-25 15:54:53,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87832 to 75892. [2022-11-25 15:54:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75892 states, 75891 states have (on average 1.0762672780698634) internal successors, (81679), 75891 states have internal predecessors, (81679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:54,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75892 states to 75892 states and 81679 transitions. [2022-11-25 15:54:54,040 INFO L78 Accepts]: Start accepts. Automaton has 75892 states and 81679 transitions. Word has length 1038 [2022-11-25 15:54:54,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:54:54,041 INFO L495 AbstractCegarLoop]: Abstraction has 75892 states and 81679 transitions. [2022-11-25 15:54:54,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 75892 states and 81679 transitions. [2022-11-25 15:54:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1102 [2022-11-25 15:54:54,454 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:54:54,455 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 15:54:54,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 15:54:54,465 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:54:54,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:54:54,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1804249184, now seen corresponding path program 1 times [2022-11-25 15:54:54,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:54:54,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333094426] [2022-11-25 15:54:54,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:54:54,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:54:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:54:55,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1479 backedges. 1190 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-11-25 15:54:55,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:54:55,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333094426] [2022-11-25 15:54:55,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333094426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:54:55,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:54:55,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:54:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626930124] [2022-11-25 15:54:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:54:55,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:54:55,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:54:55,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:54:55,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:54:55,606 INFO L87 Difference]: Start difference. First operand 75892 states and 81679 transitions. Second operand has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:54:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:54:59,637 INFO L93 Difference]: Finished difference Result 165010 states and 177375 transitions. [2022-11-25 15:54:59,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:54:59,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 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 1101 [2022-11-25 15:54:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:54:59,713 INFO L225 Difference]: With dead ends: 165010 [2022-11-25 15:54:59,713 INFO L226 Difference]: Without dead ends: 89120 [2022-11-25 15:54:59,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:54:59,732 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 577 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 2145 mSolverCounterSat, 203 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 577 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 2348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 203 IncrementalHoareTripleChecker+Valid, 2145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-25 15:54:59,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [577 Valid, 698 Invalid, 2348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [203 Valid, 2145 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-25 15:54:59,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89120 states. [2022-11-25 15:55:00,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89120 to 78444. [2022-11-25 15:55:00,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78444 states, 78443 states have (on average 1.07523934576699) internal successors, (84345), 78443 states have internal predecessors, (84345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:00,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78444 states to 78444 states and 84345 transitions. [2022-11-25 15:55:00,779 INFO L78 Accepts]: Start accepts. Automaton has 78444 states and 84345 transitions. Word has length 1101 [2022-11-25 15:55:00,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:55:00,779 INFO L495 AbstractCegarLoop]: Abstraction has 78444 states and 84345 transitions. [2022-11-25 15:55:00,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:00,779 INFO L276 IsEmpty]: Start isEmpty. Operand 78444 states and 84345 transitions. [2022-11-25 15:55:00,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2022-11-25 15:55:00,833 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:55:00,833 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-11-25 15:55:00,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 15:55:00,833 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:55:00,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:55:00,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1015837885, now seen corresponding path program 1 times [2022-11-25 15:55:00,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:55:00,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330623207] [2022-11-25 15:55:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:55:00,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:55:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:55:01,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1551 backedges. 1262 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-11-25 15:55:01,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:55:01,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330623207] [2022-11-25 15:55:01,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330623207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:55:01,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:55:01,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:55:01,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808170089] [2022-11-25 15:55:01,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:55:01,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:55:01,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:55:01,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:55:01,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:55:01,680 INFO L87 Difference]: Start difference. First operand 78444 states and 84345 transitions. Second operand has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:04,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:55:04,252 INFO L93 Difference]: Finished difference Result 155604 states and 167306 transitions. [2022-11-25 15:55:04,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:55:04,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 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 1135 [2022-11-25 15:55:04,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:55:04,330 INFO L225 Difference]: With dead ends: 155604 [2022-11-25 15:55:04,330 INFO L226 Difference]: Without dead ends: 77587 [2022-11-25 15:55:04,352 INFO L412 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 [2022-11-25 15:55:04,353 INFO L413 NwaCegarLoop]: 616 mSDtfsCounter, 130 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 1243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:55:04,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 666 Invalid, 1243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1127 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-11-25 15:55:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77587 states. [2022-11-25 15:55:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77587 to 75458. [2022-11-25 15:55:05,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75458 states, 75457 states have (on average 1.0669785440714579) internal successors, (80511), 75457 states have internal predecessors, (80511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75458 states to 75458 states and 80511 transitions. [2022-11-25 15:55:05,611 INFO L78 Accepts]: Start accepts. Automaton has 75458 states and 80511 transitions. Word has length 1135 [2022-11-25 15:55:05,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:55:05,611 INFO L495 AbstractCegarLoop]: Abstraction has 75458 states and 80511 transitions. [2022-11-25 15:55:05,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 310.0) internal successors, (930), 3 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 75458 states and 80511 transitions. [2022-11-25 15:55:05,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1146 [2022-11-25 15:55:05,664 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:55:05,665 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:55:05,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 15:55:05,665 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:55:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:55:05,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1683885294, now seen corresponding path program 1 times [2022-11-25 15:55:05,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:55:05,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765502860] [2022-11-25 15:55:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:55:05,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:55:05,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:55:06,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 1646 proven. 0 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2022-11-25 15:55:06,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:55:06,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765502860] [2022-11-25 15:55:06,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765502860] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:55:06,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:55:06,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:55:06,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242740879] [2022-11-25 15:55:06,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:55:06,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:55:06,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:55:06,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:55:06,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:55:06,897 INFO L87 Difference]: Start difference. First operand 75458 states and 80511 transitions. Second operand has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:11,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:55:11,406 INFO L93 Difference]: Finished difference Result 170051 states and 181568 transitions. [2022-11-25 15:55:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:55:11,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 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 1145 [2022-11-25 15:55:11,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:55:11,495 INFO L225 Difference]: With dead ends: 170051 [2022-11-25 15:55:11,495 INFO L226 Difference]: Without dead ends: 94170 [2022-11-25 15:55:11,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:55:11,530 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 845 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2600 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 2600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-25 15:55:11,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 140 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 2600 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-25 15:55:11,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94170 states. [2022-11-25 15:55:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94170 to 80967. [2022-11-25 15:55:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80967 states, 80966 states have (on average 1.0640392263419214) internal successors, (86151), 80966 states have internal predecessors, (86151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80967 states to 80967 states and 86151 transitions. [2022-11-25 15:55:12,525 INFO L78 Accepts]: Start accepts. Automaton has 80967 states and 86151 transitions. Word has length 1145 [2022-11-25 15:55:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:55:12,526 INFO L495 AbstractCegarLoop]: Abstraction has 80967 states and 86151 transitions. [2022-11-25 15:55:12,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 176.4) internal successors, (882), 5 states have internal predecessors, (882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:12,526 INFO L276 IsEmpty]: Start isEmpty. Operand 80967 states and 86151 transitions. [2022-11-25 15:55:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1214 [2022-11-25 15:55:12,581 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:55:12,581 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:55:12,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 15:55:12,582 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:55:12,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:55:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash 704710622, now seen corresponding path program 1 times [2022-11-25 15:55:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:55:12,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415057687] [2022-11-25 15:55:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:55:12,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:55:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:55:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 1781 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2022-11-25 15:55:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:55:14,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415057687] [2022-11-25 15:55:14,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415057687] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:55:14,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:55:14,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:55:14,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917539196] [2022-11-25 15:55:14,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:55:14,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:55:14,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:55:14,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:55:14,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:55:14,434 INFO L87 Difference]: Start difference. First operand 80967 states and 86151 transitions. Second operand has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:16,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:55:16,819 INFO L93 Difference]: Finished difference Result 163207 states and 173753 transitions. [2022-11-25 15:55:16,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:55:16,820 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 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 1213 [2022-11-25 15:55:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:55:16,891 INFO L225 Difference]: With dead ends: 163207 [2022-11-25 15:55:16,891 INFO L226 Difference]: Without dead ends: 82667 [2022-11-25 15:55:16,923 INFO L412 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 [2022-11-25 15:55:16,924 INFO L413 NwaCegarLoop]: 644 mSDtfsCounter, 128 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-25 15:55:16,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 682 Invalid, 1212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-25 15:55:16,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82667 states. [2022-11-25 15:55:17,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82667 to 77134. [2022-11-25 15:55:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77134 states, 77133 states have (on average 1.0576406985337015) internal successors, (81579), 77133 states have internal predecessors, (81579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:18,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77134 states to 77134 states and 81579 transitions. [2022-11-25 15:55:18,175 INFO L78 Accepts]: Start accepts. Automaton has 77134 states and 81579 transitions. Word has length 1213 [2022-11-25 15:55:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:55:18,175 INFO L495 AbstractCegarLoop]: Abstraction has 77134 states and 81579 transitions. [2022-11-25 15:55:18,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 272.3333333333333) internal successors, (817), 3 states have internal predecessors, (817), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:18,175 INFO L276 IsEmpty]: Start isEmpty. Operand 77134 states and 81579 transitions. [2022-11-25 15:55:18,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2022-11-25 15:55:18,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:55:18,232 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:55:18,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 15:55:18,232 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:55:18,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:55:18,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1566406914, now seen corresponding path program 1 times [2022-11-25 15:55:18,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:55:18,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620743525] [2022-11-25 15:55:18,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:55:18,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:55:18,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:55:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 2074 proven. 0 refuted. 0 times theorem prover too weak. 1122 trivial. 0 not checked. [2022-11-25 15:55:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:55:20,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620743525] [2022-11-25 15:55:20,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620743525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:55:20,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:55:20,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:55:20,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371925092] [2022-11-25 15:55:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:55:20,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:55:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:55:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:55:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:55:20,206 INFO L87 Difference]: Start difference. First operand 77134 states and 81579 transitions. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:23,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:55:23,994 INFO L93 Difference]: Finished difference Result 149539 states and 157572 transitions. [2022-11-25 15:55:23,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:55:23,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 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 1324 [2022-11-25 15:55:23,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:55:24,063 INFO L225 Difference]: With dead ends: 149539 [2022-11-25 15:55:24,063 INFO L226 Difference]: Without dead ends: 72832 [2022-11-25 15:55:24,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:55:24,092 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 786 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2641 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 2641 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-11-25 15:55:24,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 285 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 2641 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-11-25 15:55:24,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72832 states. [2022-11-25 15:55:24,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72832 to 68152. [2022-11-25 15:55:24,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68152 states, 68151 states have (on average 1.0483045003008027) internal successors, (71443), 68151 states have internal predecessors, (71443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:24,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68152 states to 68152 states and 71443 transitions. [2022-11-25 15:55:24,993 INFO L78 Accepts]: Start accepts. Automaton has 68152 states and 71443 transitions. Word has length 1324 [2022-11-25 15:55:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:55:24,993 INFO L495 AbstractCegarLoop]: Abstraction has 68152 states and 71443 transitions. [2022-11-25 15:55:24,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:55:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 68152 states and 71443 transitions. [2022-11-25 15:55:25,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2022-11-25 15:55:25,048 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:55:25,049 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:55:25,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 15:55:25,049 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 15:55:25,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:55:25,050 INFO L85 PathProgramCache]: Analyzing trace with hash 408482392, now seen corresponding path program 1 times [2022-11-25 15:55:25,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:55:25,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308834383] [2022-11-25 15:55:25,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:55:25,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms