./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e77bebacf9cc027e4e188a98d7f434947d60e1a94e9441a91471f1ac89fe261 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:17:03,347 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:17:03,418 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 01:17:03,424 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:17:03,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:17:03,451 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:17:03,452 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:17:03,452 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:17:03,453 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:17:03,454 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:17:03,454 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:17:03,455 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:17:03,455 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:17:03,456 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:17:03,456 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:17:03,457 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:17:03,458 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 01:17:03,458 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:17:03,459 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:17:03,459 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:17:03,460 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:17:03,460 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 01:17:03,461 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:17:03,461 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 01:17:03,462 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:17:03,462 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 01:17:03,463 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:17:03,463 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:17:03,464 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:17:03,464 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:17:03,464 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:17:03,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:17:03,465 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:17:03,466 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:17:03,466 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 01:17:03,466 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:17:03,467 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:17:03,467 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:17:03,467 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:17:03,467 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 01:17:03,467 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:17:03,468 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:17:03,468 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/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_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e77bebacf9cc027e4e188a98d7f434947d60e1a94e9441a91471f1ac89fe261 [2023-11-29 01:17:03,720 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:17:03,744 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:17:03,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:17:03,748 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:17:03,749 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:17:03,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i [2023-11-29 01:17:06,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:17:06,967 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:17:06,968 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i [2023-11-29 01:17:06,979 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/data/c544bb8c2/b7a5713c5fe849fca9baec7f1a1562b5/FLAG852bbcf8c [2023-11-29 01:17:06,994 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/data/c544bb8c2/b7a5713c5fe849fca9baec7f1a1562b5 [2023-11-29 01:17:06,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:17:06,999 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:17:07,000 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:17:07,000 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:17:07,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:17:07,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:17:06" (1/1) ... [2023-11-29 01:17:07,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174a2f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07, skipping insertion in model container [2023-11-29 01:17:07,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:17:06" (1/1) ... [2023-11-29 01:17:07,043 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:17:07,180 WARN L240 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_501b05d2-7491-4d1f-97e2-cec06d9a1e72/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i[916,929] [2023-11-29 01:17:07,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:17:07,254 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:17:07,265 WARN L240 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_501b05d2-7491-4d1f-97e2-cec06d9a1e72/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-90.i[916,929] [2023-11-29 01:17:07,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:17:07,328 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:17:07,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07 WrapperNode [2023-11-29 01:17:07,329 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:17:07,330 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:17:07,330 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:17:07,330 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:17:07,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,352 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,395 INFO L138 Inliner]: procedures = 26, calls = 162, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 407 [2023-11-29 01:17:07,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:17:07,396 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:17:07,396 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:17:07,396 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:17:07,410 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,410 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,417 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,439 INFO L175 MemorySlicer]: Split 130 memory accesses to 2 slices as follows [2, 128]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2023-11-29 01:17:07,440 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,440 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,462 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,472 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,475 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:17:07,476 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:17:07,476 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:17:07,476 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:17:07,477 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (1/1) ... [2023-11-29 01:17:07,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:17:07,495 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:07,511 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:17:07,521 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:17:07,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:17:07,553 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 01:17:07,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 01:17:07,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:17:07,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:17:07,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:17:07,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:17:07,676 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:17:07,678 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:17:08,152 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:17:08,189 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:17:08,189 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 01:17:08,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:17:08 BoogieIcfgContainer [2023-11-29 01:17:08,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:17:08,194 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:17:08,194 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:17:08,198 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:17:08,198 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:17:06" (1/3) ... [2023-11-29 01:17:08,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f304e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:17:08, skipping insertion in model container [2023-11-29 01:17:08,199 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:17:07" (2/3) ... [2023-11-29 01:17:08,199 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f304e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:17:08, skipping insertion in model container [2023-11-29 01:17:08,200 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:17:08" (3/3) ... [2023-11-29 01:17:08,201 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-90.i [2023-11-29 01:17:08,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:17:08,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 01:17:08,271 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:17:08,278 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@10b06b11, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:17:08,278 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 01:17:08,282 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:08,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 01:17:08,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:08,300 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:08,300 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:08,305 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash 584961870, now seen corresponding path program 1 times [2023-11-29 01:17:08,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:08,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337232778] [2023-11-29 01:17:08,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:08,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:08,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:08,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:08,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:08,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:08,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:08,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:08,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:08,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:08,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:08,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337232778] [2023-11-29 01:17:08,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337232778] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:08,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:08,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:17:08,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099170584] [2023-11-29 01:17:08,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:08,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 01:17:08,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:08,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 01:17:08,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:17:08,741 INFO L87 Difference]: Start difference. First operand has 104 states, 81 states have (on average 1.4074074074074074) internal successors, (114), 82 states have internal predecessors, (114), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:08,792 INFO L93 Difference]: Finished difference Result 205 states and 326 transitions. [2023-11-29 01:17:08,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 01:17:08,795 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 148 [2023-11-29 01:17:08,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:08,804 INFO L225 Difference]: With dead ends: 205 [2023-11-29 01:17:08,804 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 01:17:08,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 01:17:08,811 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:08,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 145 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:17:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 01:17:08,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2023-11-29 01:17:08,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 80 states have (on average 1.3625) internal successors, (109), 80 states have internal predecessors, (109), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 149 transitions. [2023-11-29 01:17:08,864 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 149 transitions. Word has length 148 [2023-11-29 01:17:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:08,865 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 149 transitions. [2023-11-29 01:17:08,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 149 transitions. [2023-11-29 01:17:08,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 01:17:08,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:08,870 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:08,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:17:08,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:08,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:08,872 INFO L85 PathProgramCache]: Analyzing trace with hash 2029456678, now seen corresponding path program 1 times [2023-11-29 01:17:08,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:08,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271525215] [2023-11-29 01:17:08,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:08,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:09,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:09,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:09,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:09,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:09,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:09,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:09,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:09,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,307 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271525215] [2023-11-29 01:17:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271525215] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:09,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:09,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:17:09,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664806218] [2023-11-29 01:17:09,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:09,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:17:09,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:09,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:17:09,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:17:09,313 INFO L87 Difference]: Start difference. First operand 102 states and 149 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:09,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:09,393 INFO L93 Difference]: Finished difference Result 231 states and 339 transitions. [2023-11-29 01:17:09,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:17:09,394 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 148 [2023-11-29 01:17:09,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:09,398 INFO L225 Difference]: With dead ends: 231 [2023-11-29 01:17:09,398 INFO L226 Difference]: Without dead ends: 130 [2023-11-29 01:17:09,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:09,401 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 61 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:09,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 466 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:17:09,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2023-11-29 01:17:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2023-11-29 01:17:09,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 82 states have (on average 1.353658536585366) internal successors, (111), 82 states have internal predecessors, (111), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:09,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 151 transitions. [2023-11-29 01:17:09,419 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 151 transitions. Word has length 148 [2023-11-29 01:17:09,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:09,422 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 151 transitions. [2023-11-29 01:17:09,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:09,422 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 151 transitions. [2023-11-29 01:17:09,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 01:17:09,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:09,426 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:09,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:17:09,426 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:09,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:09,427 INFO L85 PathProgramCache]: Analyzing trace with hash 737193547, now seen corresponding path program 1 times [2023-11-29 01:17:09,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:09,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374983014] [2023-11-29 01:17:09,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:09,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:09,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:09,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:09,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:09,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:09,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:10,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:10,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:10,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:10,008 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:10,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:10,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374983014] [2023-11-29 01:17:10,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374983014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:10,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:10,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:17:10,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333526372] [2023-11-29 01:17:10,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:10,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:17:10,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:10,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:17:10,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:10,012 INFO L87 Difference]: Start difference. First operand 104 states and 151 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:10,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:10,466 INFO L93 Difference]: Finished difference Result 312 states and 453 transitions. [2023-11-29 01:17:10,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:10,467 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-29 01:17:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:10,470 INFO L225 Difference]: With dead ends: 312 [2023-11-29 01:17:10,471 INFO L226 Difference]: Without dead ends: 209 [2023-11-29 01:17:10,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:10,473 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 126 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:10,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 714 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:17:10,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-11-29 01:17:10,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 109. [2023-11-29 01:17:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 87 states have internal predecessors, (117), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:10,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2023-11-29 01:17:10,490 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 150 [2023-11-29 01:17:10,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:10,491 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2023-11-29 01:17:10,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:10,491 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2023-11-29 01:17:10,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2023-11-29 01:17:10,494 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:10,494 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:10,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:17:10,495 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:10,495 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:10,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1159895373, now seen corresponding path program 1 times [2023-11-29 01:17:10,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:10,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794982371] [2023-11-29 01:17:10,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:10,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:11,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:11,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:11,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:11,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794982371] [2023-11-29 01:17:11,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794982371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:11,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:11,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:11,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641504412] [2023-11-29 01:17:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:11,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:11,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:11,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:11,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:11,100 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:11,776 INFO L93 Difference]: Finished difference Result 311 states and 449 transitions. [2023-11-29 01:17:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 150 [2023-11-29 01:17:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:11,780 INFO L225 Difference]: With dead ends: 311 [2023-11-29 01:17:11,780 INFO L226 Difference]: Without dead ends: 203 [2023-11-29 01:17:11,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:17:11,782 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 361 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:11,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 229 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:17:11,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-11-29 01:17:11,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 111. [2023-11-29 01:17:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.3370786516853932) internal successors, (119), 89 states have internal predecessors, (119), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-11-29 01:17:11,801 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 150 [2023-11-29 01:17:11,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:11,802 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-11-29 01:17:11,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 6 states have internal predecessors, (53), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:11,802 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-11-29 01:17:11,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 01:17:11,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:11,805 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:11,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:17:11,805 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:11,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:11,806 INFO L85 PathProgramCache]: Analyzing trace with hash -685099385, now seen corresponding path program 1 times [2023-11-29 01:17:11,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:11,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423644377] [2023-11-29 01:17:11,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:11,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:12,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:12,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:12,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:12,889 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:12,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:12,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423644377] [2023-11-29 01:17:12,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423644377] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:12,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:12,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:17:12,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354695483] [2023-11-29 01:17:12,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:12,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:17:12,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:12,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:17:12,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:17:12,893 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:13,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:13,539 INFO L93 Difference]: Finished difference Result 354 states and 508 transitions. [2023-11-29 01:17:13,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:17:13,540 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2023-11-29 01:17:13,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:13,542 INFO L225 Difference]: With dead ends: 354 [2023-11-29 01:17:13,542 INFO L226 Difference]: Without dead ends: 244 [2023-11-29 01:17:13,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:17:13,544 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 169 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:13,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 647 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 01:17:13,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-11-29 01:17:13,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 145. [2023-11-29 01:17:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 123 states have (on average 1.3577235772357723) internal successors, (167), 123 states have internal predecessors, (167), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:13,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 207 transitions. [2023-11-29 01:17:13,564 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 207 transitions. Word has length 151 [2023-11-29 01:17:13,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:13,565 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 207 transitions. [2023-11-29 01:17:13,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:13,566 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 207 transitions. [2023-11-29 01:17:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2023-11-29 01:17:13,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:13,569 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:13,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:17:13,570 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:13,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash -943264823, now seen corresponding path program 1 times [2023-11-29 01:17:13,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:13,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432293896] [2023-11-29 01:17:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:13,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:14,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:14,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:14,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:14,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432293896] [2023-11-29 01:17:14,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432293896] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:14,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:14,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:17:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137110427] [2023-11-29 01:17:14,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:14,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:17:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:14,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:17:14,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:14,778 INFO L87 Difference]: Start difference. First operand 145 states and 207 transitions. Second operand has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:15,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:15,116 INFO L93 Difference]: Finished difference Result 313 states and 445 transitions. [2023-11-29 01:17:15,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:17:15,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 151 [2023-11-29 01:17:15,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:15,119 INFO L225 Difference]: With dead ends: 313 [2023-11-29 01:17:15,119 INFO L226 Difference]: Without dead ends: 169 [2023-11-29 01:17:15,120 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:17:15,121 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 177 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:15,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 457 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-11-29 01:17:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 152. [2023-11-29 01:17:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.3410852713178294) internal successors, (173), 129 states have internal predecessors, (173), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 01:17:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 213 transitions. [2023-11-29 01:17:15,133 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 213 transitions. Word has length 151 [2023-11-29 01:17:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:15,134 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 213 transitions. [2023-11-29 01:17:15,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.0) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 213 transitions. [2023-11-29 01:17:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 01:17:15,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:15,136 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:15,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:17:15,136 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:15,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:15,137 INFO L85 PathProgramCache]: Analyzing trace with hash 372292528, now seen corresponding path program 1 times [2023-11-29 01:17:15,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:15,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141849574] [2023-11-29 01:17:15,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:15,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:17,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:17,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:17,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:17,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:17,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:17,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:17,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:17,098 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:17,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:17,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141849574] [2023-11-29 01:17:17,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141849574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:17,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:17,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:17:17,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172977154] [2023-11-29 01:17:17,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:17,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:17:17,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:17,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:17:17,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:17:17,102 INFO L87 Difference]: Start difference. First operand 152 states and 213 transitions. Second operand has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:19,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:19,586 INFO L93 Difference]: Finished difference Result 464 states and 651 transitions. [2023-11-29 01:17:19,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:17:19,589 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-11-29 01:17:19,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:19,592 INFO L225 Difference]: With dead ends: 464 [2023-11-29 01:17:19,593 INFO L226 Difference]: Without dead ends: 313 [2023-11-29 01:17:19,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:17:19,595 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 275 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:19,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 1283 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 01:17:19,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2023-11-29 01:17:19,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 213. [2023-11-29 01:17:19,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 187 states have (on average 1.3475935828877006) internal successors, (252), 188 states have internal predecessors, (252), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:17:19,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 296 transitions. [2023-11-29 01:17:19,623 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 296 transitions. Word has length 152 [2023-11-29 01:17:19,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:19,624 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 296 transitions. [2023-11-29 01:17:19,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.5) internal successors, (55), 10 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:19,624 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 296 transitions. [2023-11-29 01:17:19,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 01:17:19,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:19,627 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:19,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:17:19,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:19,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:19,628 INFO L85 PathProgramCache]: Analyzing trace with hash -214513486, now seen corresponding path program 1 times [2023-11-29 01:17:19,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:19,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806761940] [2023-11-29 01:17:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:19,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:21,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:21,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:21,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:21,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:21,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:21,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:21,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:21,629 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:21,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:21,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806761940] [2023-11-29 01:17:21,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806761940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:21,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:21,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:17:21,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701867201] [2023-11-29 01:17:21,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:21,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:17:21,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:21,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:17:21,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:21,632 INFO L87 Difference]: Start difference. First operand 213 states and 296 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:22,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:22,258 INFO L93 Difference]: Finished difference Result 502 states and 696 transitions. [2023-11-29 01:17:22,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:17:22,259 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 152 [2023-11-29 01:17:22,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:22,263 INFO L225 Difference]: With dead ends: 502 [2023-11-29 01:17:22,264 INFO L226 Difference]: Without dead ends: 290 [2023-11-29 01:17:22,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:17:22,265 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 118 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:22,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 817 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:17:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-11-29 01:17:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 207. [2023-11-29 01:17:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 182 states have internal predecessors, (242), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:17:22,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 286 transitions. [2023-11-29 01:17:22,290 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 286 transitions. Word has length 152 [2023-11-29 01:17:22,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:22,291 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 286 transitions. [2023-11-29 01:17:22,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:22,292 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 286 transitions. [2023-11-29 01:17:22,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 01:17:22,294 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:22,294 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:22,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:17:22,295 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:22,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:22,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1216055374, now seen corresponding path program 1 times [2023-11-29 01:17:22,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:22,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365664855] [2023-11-29 01:17:22,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:22,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:23,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:23,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:23,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:23,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:23,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:23,797 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:23,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:23,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365664855] [2023-11-29 01:17:23,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365664855] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:23,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:23,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:17:23,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250953152] [2023-11-29 01:17:23,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:23,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:17:23,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:23,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:17:23,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:23,800 INFO L87 Difference]: Start difference. First operand 207 states and 286 transitions. Second operand has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:24,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:24,312 INFO L93 Difference]: Finished difference Result 492 states and 679 transitions. [2023-11-29 01:17:24,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:17:24,313 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 152 [2023-11-29 01:17:24,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:24,316 INFO L225 Difference]: With dead ends: 492 [2023-11-29 01:17:24,316 INFO L226 Difference]: Without dead ends: 286 [2023-11-29 01:17:24,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:17:24,318 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 133 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:24,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 689 Invalid, 455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:17:24,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-29 01:17:24,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 207. [2023-11-29 01:17:24,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 182 states have internal predecessors, (240), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-29 01:17:24,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 284 transitions. [2023-11-29 01:17:24,336 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 284 transitions. Word has length 152 [2023-11-29 01:17:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:24,336 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 284 transitions. [2023-11-29 01:17:24,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.166666666666666) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 284 transitions. [2023-11-29 01:17:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 01:17:24,338 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:24,339 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:24,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:17:24,339 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:24,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:24,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1802861388, now seen corresponding path program 1 times [2023-11-29 01:17:24,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:24,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189781683] [2023-11-29 01:17:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:24,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:24,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:25,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:25,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:25,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:25,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:25,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:25,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,780 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 54 proven. 54 refuted. 0 times theorem prover too weak. 652 trivial. 0 not checked. [2023-11-29 01:17:25,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189781683] [2023-11-29 01:17:25,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189781683] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:25,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612559124] [2023-11-29 01:17:25,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:25,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:25,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:25,782 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:25,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:17:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:25,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 01:17:25,985 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:26,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 51 [2023-11-29 01:17:26,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 26 [2023-11-29 01:17:26,089 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-11-29 01:17:26,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:17:26,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 32 [2023-11-29 01:17:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 01:17:26,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:17:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612559124] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:26,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 01:17:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10, 10] total 19 [2023-11-29 01:17:26,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058722431] [2023-11-29 01:17:26,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:26,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:17:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:26,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:17:26,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:17:26,580 INFO L87 Difference]: Start difference. First operand 207 states and 284 transitions. Second operand has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:27,428 INFO L93 Difference]: Finished difference Result 539 states and 739 transitions. [2023-11-29 01:17:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:17:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 152 [2023-11-29 01:17:27,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:27,431 INFO L225 Difference]: With dead ends: 539 [2023-11-29 01:17:27,431 INFO L226 Difference]: Without dead ends: 333 [2023-11-29 01:17:27,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 339 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2023-11-29 01:17:27,433 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 211 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:27,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 1020 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:17:27,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-29 01:17:27,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 260. [2023-11-29 01:17:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 226 states have (on average 1.3185840707964602) internal successors, (298), 228 states have internal predecessors, (298), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 01:17:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 354 transitions. [2023-11-29 01:17:27,453 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 354 transitions. Word has length 152 [2023-11-29 01:17:27,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:27,454 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 354 transitions. [2023-11-29 01:17:27,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.875) internal successors, (55), 8 states have internal predecessors, (55), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:27,454 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 354 transitions. [2023-11-29 01:17:27,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 01:17:27,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:27,456 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:27,469 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 01:17:27,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-29 01:17:27,657 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:27,657 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:27,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1680575609, now seen corresponding path program 1 times [2023-11-29 01:17:27,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:27,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053396829] [2023-11-29 01:17:27,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:27,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:28,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:28,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:28,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:28,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:28,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:28,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:28,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:28,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053396829] [2023-11-29 01:17:28,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053396829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:28,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:17:28,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226195321] [2023-11-29 01:17:28,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:28,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:17:28,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:28,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:17:28,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:28,556 INFO L87 Difference]: Start difference. First operand 260 states and 354 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:28,885 INFO L93 Difference]: Finished difference Result 760 states and 1041 transitions. [2023-11-29 01:17:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:17:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 01:17:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:28,890 INFO L225 Difference]: With dead ends: 760 [2023-11-29 01:17:28,890 INFO L226 Difference]: Without dead ends: 501 [2023-11-29 01:17:28,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:28,891 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 142 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:28,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 378 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:28,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2023-11-29 01:17:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 256. [2023-11-29 01:17:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 222 states have (on average 1.3198198198198199) internal successors, (293), 224 states have internal predecessors, (293), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 01:17:28,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 349 transitions. [2023-11-29 01:17:28,920 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 349 transitions. Word has length 153 [2023-11-29 01:17:28,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:28,920 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 349 transitions. [2023-11-29 01:17:28,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:28,921 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 349 transitions. [2023-11-29 01:17:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 01:17:28,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:28,923 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:28,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:17:28,924 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:28,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1603274437, now seen corresponding path program 1 times [2023-11-29 01:17:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322597498] [2023-11-29 01:17:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:29,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:29,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:29,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:29,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:29,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:29,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:29,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,251 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:29,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:29,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322597498] [2023-11-29 01:17:29,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322597498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:29,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:29,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:29,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974796576] [2023-11-29 01:17:29,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:29,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:29,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:29,253 INFO L87 Difference]: Start difference. First operand 256 states and 349 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:29,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:29,583 INFO L93 Difference]: Finished difference Result 649 states and 889 transitions. [2023-11-29 01:17:29,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:17:29,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 01:17:29,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:29,587 INFO L225 Difference]: With dead ends: 649 [2023-11-29 01:17:29,587 INFO L226 Difference]: Without dead ends: 394 [2023-11-29 01:17:29,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:17:29,589 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 141 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:29,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 504 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:29,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-29 01:17:29,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 295. [2023-11-29 01:17:29,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 261 states have (on average 1.314176245210728) internal successors, (343), 263 states have internal predecessors, (343), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 01:17:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 399 transitions. [2023-11-29 01:17:29,616 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 399 transitions. Word has length 153 [2023-11-29 01:17:29,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:29,617 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 399 transitions. [2023-11-29 01:17:29,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 399 transitions. [2023-11-29 01:17:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 01:17:29,619 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:29,620 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:29,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:17:29,620 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:29,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:29,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1912791813, now seen corresponding path program 1 times [2023-11-29 01:17:29,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:29,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582422875] [2023-11-29 01:17:29,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:29,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:29,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:29,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:29,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:29,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:29,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:29,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:29,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:29,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:29,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:29,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:29,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:29,948 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:29,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:29,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582422875] [2023-11-29 01:17:29,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582422875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:29,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:29,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:29,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199888326] [2023-11-29 01:17:29,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:29,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:29,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:29,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:29,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:29,951 INFO L87 Difference]: Start difference. First operand 295 states and 399 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:30,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:30,297 INFO L93 Difference]: Finished difference Result 829 states and 1140 transitions. [2023-11-29 01:17:30,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:17:30,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 01:17:30,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:30,301 INFO L225 Difference]: With dead ends: 829 [2023-11-29 01:17:30,302 INFO L226 Difference]: Without dead ends: 535 [2023-11-29 01:17:30,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:17:30,303 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 135 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:30,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 612 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:30,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-11-29 01:17:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 336. [2023-11-29 01:17:30,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 302 states have (on average 1.3178807947019868) internal successors, (398), 304 states have internal predecessors, (398), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 01:17:30,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 454 transitions. [2023-11-29 01:17:30,333 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 454 transitions. Word has length 153 [2023-11-29 01:17:30,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:30,333 INFO L495 AbstractCegarLoop]: Abstraction has 336 states and 454 transitions. [2023-11-29 01:17:30,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 6 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:30,334 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 454 transitions. [2023-11-29 01:17:30,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2023-11-29 01:17:30,336 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:30,336 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:30,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:17:30,336 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:30,337 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:30,337 INFO L85 PathProgramCache]: Analyzing trace with hash -901674563, now seen corresponding path program 1 times [2023-11-29 01:17:30,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:30,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005926873] [2023-11-29 01:17:30,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:31,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:31,095 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:31,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:31,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005926873] [2023-11-29 01:17:31,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005926873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:31,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:31,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:17:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646862869] [2023-11-29 01:17:31,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:31,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:17:31,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:31,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:17:31,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:31,097 INFO L87 Difference]: Start difference. First operand 336 states and 454 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:31,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:31,430 INFO L93 Difference]: Finished difference Result 757 states and 1019 transitions. [2023-11-29 01:17:31,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:31,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 153 [2023-11-29 01:17:31,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:31,433 INFO L225 Difference]: With dead ends: 757 [2023-11-29 01:17:31,433 INFO L226 Difference]: Without dead ends: 422 [2023-11-29 01:17:31,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:31,434 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 106 mSDsluCounter, 352 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:31,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 535 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:31,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-11-29 01:17:31,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 295. [2023-11-29 01:17:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 263 states have (on average 1.2927756653992395) internal successors, (340), 264 states have internal predecessors, (340), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 01:17:31,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 392 transitions. [2023-11-29 01:17:31,452 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 392 transitions. Word has length 153 [2023-11-29 01:17:31,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:31,453 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 392 transitions. [2023-11-29 01:17:31,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:31,453 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 392 transitions. [2023-11-29 01:17:31,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2023-11-29 01:17:31,455 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:31,455 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:31,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:17:31,455 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:31,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:31,456 INFO L85 PathProgramCache]: Analyzing trace with hash 880059055, now seen corresponding path program 1 times [2023-11-29 01:17:31,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:31,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248638539] [2023-11-29 01:17:31,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:31,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:32,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:32,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:32,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:32,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:32,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:32,148 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:32,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248638539] [2023-11-29 01:17:32,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248638539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:32,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:32,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 01:17:32,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132698507] [2023-11-29 01:17:32,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:32,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:17:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:32,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:17:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:17:32,151 INFO L87 Difference]: Start difference. First operand 295 states and 392 transitions. Second operand has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:32,601 INFO L93 Difference]: Finished difference Result 665 states and 893 transitions. [2023-11-29 01:17:32,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:17:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 154 [2023-11-29 01:17:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:32,605 INFO L225 Difference]: With dead ends: 665 [2023-11-29 01:17:32,605 INFO L226 Difference]: Without dead ends: 371 [2023-11-29 01:17:32,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:17:32,607 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 268 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:32,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 614 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-11-29 01:17:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 297. [2023-11-29 01:17:32,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 265 states have (on average 1.290566037735849) internal successors, (342), 266 states have internal predecessors, (342), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-29 01:17:32,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 394 transitions. [2023-11-29 01:17:32,632 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 394 transitions. Word has length 154 [2023-11-29 01:17:32,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:32,632 INFO L495 AbstractCegarLoop]: Abstraction has 297 states and 394 transitions. [2023-11-29 01:17:32,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.125) internal successors, (57), 9 states have internal predecessors, (57), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:32,632 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 394 transitions. [2023-11-29 01:17:32,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:32,634 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:32,634 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:32,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:17:32,634 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:32,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -533290926, now seen corresponding path program 1 times [2023-11-29 01:17:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:32,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822073180] [2023-11-29 01:17:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:32,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:33,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:33,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:33,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:33,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:33,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:33,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:33,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:33,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:33,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:33,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:33,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:33,136 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:33,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:33,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822073180] [2023-11-29 01:17:33,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822073180] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:33,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:33,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:33,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794775679] [2023-11-29 01:17:33,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:33,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:33,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:33,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:33,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:33,138 INFO L87 Difference]: Start difference. First operand 297 states and 394 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:33,514 INFO L93 Difference]: Finished difference Result 808 states and 1060 transitions. [2023-11-29 01:17:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:33,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-11-29 01:17:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:33,518 INFO L225 Difference]: With dead ends: 808 [2023-11-29 01:17:33,518 INFO L226 Difference]: Without dead ends: 512 [2023-11-29 01:17:33,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:33,520 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 79 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:33,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 523 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2023-11-29 01:17:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 509. [2023-11-29 01:17:33,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 509 states, 454 states have (on average 1.2665198237885462) internal successors, (575), 457 states have internal predecessors, (575), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-29 01:17:33,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 509 states to 509 states and 663 transitions. [2023-11-29 01:17:33,562 INFO L78 Accepts]: Start accepts. Automaton has 509 states and 663 transitions. Word has length 155 [2023-11-29 01:17:33,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:33,563 INFO L495 AbstractCegarLoop]: Abstraction has 509 states and 663 transitions. [2023-11-29 01:17:33,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:33,563 INFO L276 IsEmpty]: Start isEmpty. Operand 509 states and 663 transitions. [2023-11-29 01:17:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:33,565 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:33,565 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:33,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:17:33,565 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:33,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash -926317936, now seen corresponding path program 1 times [2023-11-29 01:17:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:33,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561253080] [2023-11-29 01:17:33,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:33,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:33,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:34,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:34,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:34,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:34,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:34,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:34,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:34,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:34,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:34,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:34,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561253080] [2023-11-29 01:17:34,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561253080] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:34,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:34,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 01:17:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760246446] [2023-11-29 01:17:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:17:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:17:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:17:34,564 INFO L87 Difference]: Start difference. First operand 509 states and 663 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:35,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:35,686 INFO L93 Difference]: Finished difference Result 1315 states and 1701 transitions. [2023-11-29 01:17:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:17:35,687 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-11-29 01:17:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:35,692 INFO L225 Difference]: With dead ends: 1315 [2023-11-29 01:17:35,692 INFO L226 Difference]: Without dead ends: 807 [2023-11-29 01:17:35,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:17:35,694 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 355 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 954 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:35,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 1119 Invalid, 954 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:17:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2023-11-29 01:17:35,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 792. [2023-11-29 01:17:35,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 694 states have (on average 1.2463976945244957) internal successors, (865), 700 states have internal predecessors, (865), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-29 01:17:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 1021 transitions. [2023-11-29 01:17:35,776 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 1021 transitions. Word has length 155 [2023-11-29 01:17:35,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:35,777 INFO L495 AbstractCegarLoop]: Abstraction has 792 states and 1021 transitions. [2023-11-29 01:17:35,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 1021 transitions. [2023-11-29 01:17:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:35,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:35,779 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:35,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:17:35,780 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:35,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:35,780 INFO L85 PathProgramCache]: Analyzing trace with hash -381826501, now seen corresponding path program 1 times [2023-11-29 01:17:35,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:35,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684744988] [2023-11-29 01:17:35,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:35,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:36,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:36,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:36,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684744988] [2023-11-29 01:17:36,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684744988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:36,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:36,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780037388] [2023-11-29 01:17:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:36,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:36,729 INFO L87 Difference]: Start difference. First operand 792 states and 1021 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:37,117 INFO L93 Difference]: Finished difference Result 1652 states and 2138 transitions. [2023-11-29 01:17:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 01:17:37,118 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-11-29 01:17:37,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:37,124 INFO L225 Difference]: With dead ends: 1652 [2023-11-29 01:17:37,124 INFO L226 Difference]: Without dead ends: 861 [2023-11-29 01:17:37,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:37,127 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 77 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:37,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 523 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:37,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2023-11-29 01:17:37,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 781. [2023-11-29 01:17:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 683 states have (on average 1.2357247437774523) internal successors, (844), 689 states have internal predecessors, (844), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-29 01:17:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1000 transitions. [2023-11-29 01:17:37,232 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1000 transitions. Word has length 155 [2023-11-29 01:17:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:37,233 INFO L495 AbstractCegarLoop]: Abstraction has 781 states and 1000 transitions. [2023-11-29 01:17:37,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:37,233 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1000 transitions. [2023-11-29 01:17:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:37,236 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:37,236 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:37,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 01:17:37,236 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:37,237 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1704536005, now seen corresponding path program 1 times [2023-11-29 01:17:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:37,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281763487] [2023-11-29 01:17:37,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:37,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:37,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:37,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:37,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:37,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:37,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:37,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:37,957 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:37,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:37,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281763487] [2023-11-29 01:17:37,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281763487] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:37,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:37,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:37,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31998171] [2023-11-29 01:17:37,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:37,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:37,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:37,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:37,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:37,959 INFO L87 Difference]: Start difference. First operand 781 states and 1000 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:38,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:38,259 INFO L93 Difference]: Finished difference Result 1582 states and 2027 transitions. [2023-11-29 01:17:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-11-29 01:17:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:38,264 INFO L225 Difference]: With dead ends: 1582 [2023-11-29 01:17:38,264 INFO L226 Difference]: Without dead ends: 802 [2023-11-29 01:17:38,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:38,267 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 140 mSDsluCounter, 313 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:38,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 460 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:17:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2023-11-29 01:17:38,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 777. [2023-11-29 01:17:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 777 states, 679 states have (on average 1.2312223858615612) internal successors, (836), 685 states have internal predecessors, (836), 78 states have call successors, (78), 19 states have call predecessors, (78), 19 states have return successors, (78), 72 states have call predecessors, (78), 78 states have call successors, (78) [2023-11-29 01:17:38,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 992 transitions. [2023-11-29 01:17:38,346 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 992 transitions. Word has length 155 [2023-11-29 01:17:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:38,347 INFO L495 AbstractCegarLoop]: Abstraction has 777 states and 992 transitions. [2023-11-29 01:17:38,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 992 transitions. [2023-11-29 01:17:38,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:38,349 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:38,350 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:38,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:17:38,350 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:38,350 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:38,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1553071580, now seen corresponding path program 1 times [2023-11-29 01:17:38,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:38,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062115068] [2023-11-29 01:17:38,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:38,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:38,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:38,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:38,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:38,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:38,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:38,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:38,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062115068] [2023-11-29 01:17:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062115068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:38,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401170156] [2023-11-29 01:17:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:38,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:38,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:38,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:38,869 INFO L87 Difference]: Start difference. First operand 777 states and 992 transitions. Second operand has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:39,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:39,290 INFO L93 Difference]: Finished difference Result 1776 states and 2264 transitions. [2023-11-29 01:17:39,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:39,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-11-29 01:17:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:39,296 INFO L225 Difference]: With dead ends: 1776 [2023-11-29 01:17:39,297 INFO L226 Difference]: Without dead ends: 1000 [2023-11-29 01:17:39,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:39,299 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 85 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:39,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 467 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:39,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2023-11-29 01:17:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 997. [2023-11-29 01:17:39,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 872 states have (on average 1.2259174311926606) internal successors, (1069), 880 states have internal predecessors, (1069), 100 states have call successors, (100), 24 states have call predecessors, (100), 24 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:17:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1269 transitions. [2023-11-29 01:17:39,396 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1269 transitions. Word has length 155 [2023-11-29 01:17:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:39,396 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1269 transitions. [2023-11-29 01:17:39,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.6) internal successors, (58), 6 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:39,397 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1269 transitions. [2023-11-29 01:17:39,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:39,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:39,400 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:39,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:17:39,400 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:39,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1946098590, now seen corresponding path program 1 times [2023-11-29 01:17:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680083135] [2023-11-29 01:17:39,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:39,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:40,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:40,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:40,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:40,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:40,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:40,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:40,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:40,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:40,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:40,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:40,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:40,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:40,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:40,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:40,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680083135] [2023-11-29 01:17:40,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680083135] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:40,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:40,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 01:17:40,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548359640] [2023-11-29 01:17:40,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:40,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:17:40,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:40,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:17:40,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:17:40,354 INFO L87 Difference]: Start difference. First operand 997 states and 1269 transitions. Second operand has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:41,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:41,496 INFO L93 Difference]: Finished difference Result 2207 states and 2805 transitions. [2023-11-29 01:17:41,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 01:17:41,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 155 [2023-11-29 01:17:41,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:41,505 INFO L225 Difference]: With dead ends: 2207 [2023-11-29 01:17:41,505 INFO L226 Difference]: Without dead ends: 1211 [2023-11-29 01:17:41,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=384, Unknown=0, NotChecked=0, Total=506 [2023-11-29 01:17:41,508 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 270 mSDsluCounter, 938 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:41,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1076 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:17:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2023-11-29 01:17:41,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 979. [2023-11-29 01:17:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 979 states, 877 states have (on average 1.2212086659064993) internal successors, (1071), 883 states have internal predecessors, (1071), 80 states have call successors, (80), 21 states have call predecessors, (80), 21 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:17:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 979 states to 979 states and 1231 transitions. [2023-11-29 01:17:41,608 INFO L78 Accepts]: Start accepts. Automaton has 979 states and 1231 transitions. Word has length 155 [2023-11-29 01:17:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:41,609 INFO L495 AbstractCegarLoop]: Abstraction has 979 states and 1231 transitions. [2023-11-29 01:17:41,609 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 12 states have internal predecessors, (58), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 979 states and 1231 transitions. [2023-11-29 01:17:41,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2023-11-29 01:17:41,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:41,612 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 01:17:41,613 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:41,613 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1615111194, now seen corresponding path program 1 times [2023-11-29 01:17:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:41,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243102849] [2023-11-29 01:17:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:41,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:41,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:41,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:41,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:41,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:41,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:41,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243102849] [2023-11-29 01:17:41,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243102849] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:41,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:41,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:17:41,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328341320] [2023-11-29 01:17:41,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:41,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:17:41,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:41,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:17:41,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:41,872 INFO L87 Difference]: Start difference. First operand 979 states and 1231 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:42,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:42,177 INFO L93 Difference]: Finished difference Result 2078 states and 2635 transitions. [2023-11-29 01:17:42,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:42,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 155 [2023-11-29 01:17:42,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:42,182 INFO L225 Difference]: With dead ends: 2078 [2023-11-29 01:17:42,182 INFO L226 Difference]: Without dead ends: 1100 [2023-11-29 01:17:42,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:42,184 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 121 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:42,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 721 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:17:42,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1100 states. [2023-11-29 01:17:42,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1100 to 940. [2023-11-29 01:17:42,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 940 states, 838 states have (on average 1.220763723150358) internal successors, (1023), 844 states have internal predecessors, (1023), 80 states have call successors, (80), 21 states have call predecessors, (80), 21 states have return successors, (80), 74 states have call predecessors, (80), 80 states have call successors, (80) [2023-11-29 01:17:42,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 940 states to 940 states and 1183 transitions. [2023-11-29 01:17:42,244 INFO L78 Accepts]: Start accepts. Automaton has 940 states and 1183 transitions. Word has length 155 [2023-11-29 01:17:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:42,245 INFO L495 AbstractCegarLoop]: Abstraction has 940 states and 1183 transitions. [2023-11-29 01:17:42,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:42,245 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states and 1183 transitions. [2023-11-29 01:17:42,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 01:17:42,246 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:42,247 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:42,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 01:17:42,247 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:42,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:42,247 INFO L85 PathProgramCache]: Analyzing trace with hash 208953684, now seen corresponding path program 1 times [2023-11-29 01:17:42,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:42,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779050576] [2023-11-29 01:17:42,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:42,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:42,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:42,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:42,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:42,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:42,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:42,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:42,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:42,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779050576] [2023-11-29 01:17:42,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779050576] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:42,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:42,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:17:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465595553] [2023-11-29 01:17:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:42,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:17:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:17:42,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:17:42,375 INFO L87 Difference]: Start difference. First operand 940 states and 1183 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:42,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:42,647 INFO L93 Difference]: Finished difference Result 2641 states and 3326 transitions. [2023-11-29 01:17:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:17:42,648 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 156 [2023-11-29 01:17:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:42,656 INFO L225 Difference]: With dead ends: 2641 [2023-11-29 01:17:42,657 INFO L226 Difference]: Without dead ends: 1702 [2023-11-29 01:17:42,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:42,659 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 93 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:42,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 327 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:17:42,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2023-11-29 01:17:42,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1250. [2023-11-29 01:17:42,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1250 states, 1123 states have (on average 1.2279608192341942) internal successors, (1379), 1129 states have internal predecessors, (1379), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:17:42,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1250 states to 1250 states and 1579 transitions. [2023-11-29 01:17:42,772 INFO L78 Accepts]: Start accepts. Automaton has 1250 states and 1579 transitions. Word has length 156 [2023-11-29 01:17:42,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:42,773 INFO L495 AbstractCegarLoop]: Abstraction has 1250 states and 1579 transitions. [2023-11-29 01:17:42,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 1250 states and 1579 transitions. [2023-11-29 01:17:42,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 01:17:42,775 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:42,775 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:42,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 01:17:42,776 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:42,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:42,776 INFO L85 PathProgramCache]: Analyzing trace with hash -377852330, now seen corresponding path program 1 times [2023-11-29 01:17:42,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:42,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789013244] [2023-11-29 01:17:42,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:42,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:43,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:43,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:43,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:43,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:43,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:43,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:43,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:43,490 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:43,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:43,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789013244] [2023-11-29 01:17:43,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789013244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:43,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:43,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:17:43,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142805543] [2023-11-29 01:17:43,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:43,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:17:43,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:17:43,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:43,492 INFO L87 Difference]: Start difference. First operand 1250 states and 1579 transitions. Second operand has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:17:44,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:44,120 INFO L93 Difference]: Finished difference Result 3133 states and 3957 transitions. [2023-11-29 01:17:44,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:17:44,121 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 156 [2023-11-29 01:17:44,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:44,131 INFO L225 Difference]: With dead ends: 3133 [2023-11-29 01:17:44,131 INFO L226 Difference]: Without dead ends: 2184 [2023-11-29 01:17:44,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:17:44,134 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 128 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 726 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:44,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 726 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:17:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2023-11-29 01:17:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 1480. [2023-11-29 01:17:44,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1353 states have (on average 1.23059866962306) internal successors, (1665), 1359 states have internal predecessors, (1665), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:17:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1865 transitions. [2023-11-29 01:17:44,279 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1865 transitions. Word has length 156 [2023-11-29 01:17:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:44,279 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1865 transitions. [2023-11-29 01:17:44,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 11.8) internal successors, (59), 7 states have internal predecessors, (59), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:17:44,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1865 transitions. [2023-11-29 01:17:44,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:44,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:44,283 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:44,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 01:17:44,283 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:44,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:44,284 INFO L85 PathProgramCache]: Analyzing trace with hash 899515343, now seen corresponding path program 1 times [2023-11-29 01:17:44,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:44,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039520037] [2023-11-29 01:17:44,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:44,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:44,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:44,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:44,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:44,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:44,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:44,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:44,616 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:44,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:44,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039520037] [2023-11-29 01:17:44,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039520037] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:44,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:44,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:17:44,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382027160] [2023-11-29 01:17:44,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:44,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:17:44,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:44,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:17:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:17:44,618 INFO L87 Difference]: Start difference. First operand 1480 states and 1865 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:44,970 INFO L93 Difference]: Finished difference Result 2849 states and 3605 transitions. [2023-11-29 01:17:44,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:44,971 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:17:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:44,979 INFO L225 Difference]: With dead ends: 2849 [2023-11-29 01:17:44,979 INFO L226 Difference]: Without dead ends: 1662 [2023-11-29 01:17:44,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:44,981 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 158 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:44,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 665 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:17:44,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2023-11-29 01:17:45,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1480. [2023-11-29 01:17:45,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1480 states, 1353 states have (on average 1.2187730968218773) internal successors, (1649), 1359 states have internal predecessors, (1649), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:17:45,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1480 states to 1480 states and 1849 transitions. [2023-11-29 01:17:45,101 INFO L78 Accepts]: Start accepts. Automaton has 1480 states and 1849 transitions. Word has length 157 [2023-11-29 01:17:45,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:45,102 INFO L495 AbstractCegarLoop]: Abstraction has 1480 states and 1849 transitions. [2023-11-29 01:17:45,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1480 states and 1849 transitions. [2023-11-29 01:17:45,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:45,106 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:45,106 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:45,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 01:17:45,106 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:45,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:45,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1109446901, now seen corresponding path program 1 times [2023-11-29 01:17:45,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:45,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484088763] [2023-11-29 01:17:45,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:45,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:45,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:45,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:45,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:45,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:45,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:45,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,761 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 01:17:45,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:45,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484088763] [2023-11-29 01:17:45,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484088763] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:45,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304487566] [2023-11-29 01:17:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:45,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:45,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:45,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:45,764 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:17:45,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:45,937 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 01:17:45,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:45,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 01:17:46,181 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 47 [2023-11-29 01:17:46,513 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:46,513 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:17:46,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304487566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:46,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:17:46,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2023-11-29 01:17:46,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505186345] [2023-11-29 01:17:46,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:46,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:17:46,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:46,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:17:46,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:17:46,516 INFO L87 Difference]: Start difference. First operand 1480 states and 1849 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:47,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:47,710 INFO L93 Difference]: Finished difference Result 5395 states and 6741 transitions. [2023-11-29 01:17:47,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 01:17:47,711 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:17:47,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:47,725 INFO L225 Difference]: With dead ends: 5395 [2023-11-29 01:17:47,726 INFO L226 Difference]: Without dead ends: 4226 [2023-11-29 01:17:47,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 01:17:47,728 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 516 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:47,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [516 Valid, 715 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:17:47,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4226 states. [2023-11-29 01:17:47,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4226 to 2353. [2023-11-29 01:17:47,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2353 states, 2125 states have (on average 1.2117647058823529) internal successors, (2575), 2137 states have internal predecessors, (2575), 180 states have call successors, (180), 47 states have call predecessors, (180), 47 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-29 01:17:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2353 states to 2353 states and 2935 transitions. [2023-11-29 01:17:47,959 INFO L78 Accepts]: Start accepts. Automaton has 2353 states and 2935 transitions. Word has length 157 [2023-11-29 01:17:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:47,959 INFO L495 AbstractCegarLoop]: Abstraction has 2353 states and 2935 transitions. [2023-11-29 01:17:47,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2353 states and 2935 transitions. [2023-11-29 01:17:47,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:47,963 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:47,964 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:47,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:17:48,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 01:17:48,164 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:48,165 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:48,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1410513033, now seen corresponding path program 1 times [2023-11-29 01:17:48,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:48,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354817345] [2023-11-29 01:17:48,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:48,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:48,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:48,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:48,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:48,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:48,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:48,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:48,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:48,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:48,649 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:48,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:48,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354817345] [2023-11-29 01:17:48,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354817345] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:48,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:48,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 01:17:48,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048855472] [2023-11-29 01:17:48,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:48,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:17:48,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:48,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:17:48,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:17:48,651 INFO L87 Difference]: Start difference. First operand 2353 states and 2935 transitions. Second operand has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:49,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:49,459 INFO L93 Difference]: Finished difference Result 5256 states and 6560 transitions. [2023-11-29 01:17:49,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 01:17:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-11-29 01:17:49,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:49,471 INFO L225 Difference]: With dead ends: 5256 [2023-11-29 01:17:49,471 INFO L226 Difference]: Without dead ends: 3310 [2023-11-29 01:17:49,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2023-11-29 01:17:49,474 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 316 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 789 SdHoareTripleChecker+Invalid, 805 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:49,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 789 Invalid, 805 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:17:49,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2023-11-29 01:17:49,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 2631. [2023-11-29 01:17:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2403 states have (on average 1.200582605076987) internal successors, (2885), 2415 states have internal predecessors, (2885), 180 states have call successors, (180), 47 states have call predecessors, (180), 47 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-29 01:17:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3245 transitions. [2023-11-29 01:17:49,634 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3245 transitions. Word has length 157 [2023-11-29 01:17:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:49,634 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3245 transitions. [2023-11-29 01:17:49,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.454545454545454) internal successors, (60), 12 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3245 transitions. [2023-11-29 01:17:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:49,637 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:49,637 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:49,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 01:17:49,638 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:49,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -2984757, now seen corresponding path program 1 times [2023-11-29 01:17:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534388955] [2023-11-29 01:17:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:49,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:49,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:49,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:49,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:49,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:49,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:49,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:49,969 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:49,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:49,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534388955] [2023-11-29 01:17:49,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534388955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:49,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:49,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:17:49,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739468390] [2023-11-29 01:17:49,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:49,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:17:49,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:49,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:17:49,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:17:49,971 INFO L87 Difference]: Start difference. First operand 2631 states and 3245 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:50,487 INFO L93 Difference]: Finished difference Result 5207 states and 6449 transitions. [2023-11-29 01:17:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:17:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:17:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:50,499 INFO L225 Difference]: With dead ends: 5207 [2023-11-29 01:17:50,499 INFO L226 Difference]: Without dead ends: 2905 [2023-11-29 01:17:50,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:17:50,502 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 282 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:50,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 345 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:50,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2905 states. [2023-11-29 01:17:50,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2905 to 2631. [2023-11-29 01:17:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2631 states, 2403 states have (on average 1.1681231793591345) internal successors, (2807), 2415 states have internal predecessors, (2807), 180 states have call successors, (180), 47 states have call predecessors, (180), 47 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-29 01:17:50,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2631 states to 2631 states and 3167 transitions. [2023-11-29 01:17:50,659 INFO L78 Accepts]: Start accepts. Automaton has 2631 states and 3167 transitions. Word has length 157 [2023-11-29 01:17:50,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:50,660 INFO L495 AbstractCegarLoop]: Abstraction has 2631 states and 3167 transitions. [2023-11-29 01:17:50,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:50,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2631 states and 3167 transitions. [2023-11-29 01:17:50,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:50,663 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:50,663 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:50,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 01:17:50,663 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:50,663 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:50,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1249995511, now seen corresponding path program 1 times [2023-11-29 01:17:50,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:50,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746960483] [2023-11-29 01:17:50,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:50,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:50,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:51,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:51,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:51,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:51,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:51,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:51,143 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:51,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:51,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746960483] [2023-11-29 01:17:51,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746960483] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:51,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:51,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 01:17:51,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105626503] [2023-11-29 01:17:51,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:51,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 01:17:51,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:51,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 01:17:51,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 01:17:51,144 INFO L87 Difference]: Start difference. First operand 2631 states and 3167 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:51,893 INFO L93 Difference]: Finished difference Result 4536 states and 5503 transitions. [2023-11-29 01:17:51,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:17:51,894 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:17:51,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:51,903 INFO L225 Difference]: With dead ends: 4536 [2023-11-29 01:17:51,903 INFO L226 Difference]: Without dead ends: 3180 [2023-11-29 01:17:51,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:17:51,906 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 250 mSDsluCounter, 807 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:51,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 934 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 01:17:51,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2023-11-29 01:17:52,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2732. [2023-11-29 01:17:52,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2732 states, 2504 states have (on average 1.165335463258786) internal successors, (2918), 2516 states have internal predecessors, (2918), 180 states have call successors, (180), 47 states have call predecessors, (180), 47 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-29 01:17:52,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2732 states to 2732 states and 3278 transitions. [2023-11-29 01:17:52,135 INFO L78 Accepts]: Start accepts. Automaton has 2732 states and 3278 transitions. Word has length 157 [2023-11-29 01:17:52,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:52,135 INFO L495 AbstractCegarLoop]: Abstraction has 2732 states and 3278 transitions. [2023-11-29 01:17:52,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:52,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2732 states and 3278 transitions. [2023-11-29 01:17:52,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:52,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:52,139 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:52,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 01:17:52,139 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:52,140 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:52,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1269964423, now seen corresponding path program 1 times [2023-11-29 01:17:52,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:52,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437426293] [2023-11-29 01:17:52,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:52,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:52,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:52,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:52,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:52,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 01:17:52,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:52,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437426293] [2023-11-29 01:17:52,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437426293] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:52,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939773387] [2023-11-29 01:17:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:52,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:52,756 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:52,757 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:52,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:17:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:52,938 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 01:17:52,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:52,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 01:17:53,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 55 [2023-11-29 01:17:53,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:17:53,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2023-11-29 01:17:53,720 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:53,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:17:53,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939773387] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:53,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:17:53,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 19 [2023-11-29 01:17:53,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531539681] [2023-11-29 01:17:53,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:53,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:17:53,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:53,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:17:53,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=302, Unknown=0, NotChecked=0, Total=342 [2023-11-29 01:17:53,723 INFO L87 Difference]: Start difference. First operand 2732 states and 3278 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:55,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:55,107 INFO L93 Difference]: Finished difference Result 6577 states and 7884 transitions. [2023-11-29 01:17:55,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 01:17:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:17:55,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:55,115 INFO L225 Difference]: With dead ends: 6577 [2023-11-29 01:17:55,115 INFO L226 Difference]: Without dead ends: 5120 [2023-11-29 01:17:55,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 01:17:55,118 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 338 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 1093 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:55,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 1093 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1056 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:17:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5120 states. [2023-11-29 01:17:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5120 to 3175. [2023-11-29 01:17:55,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3175 states, 2947 states have (on average 1.166610111978283) internal successors, (3438), 2959 states have internal predecessors, (3438), 180 states have call successors, (180), 47 states have call predecessors, (180), 47 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-29 01:17:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3175 states to 3175 states and 3798 transitions. [2023-11-29 01:17:55,347 INFO L78 Accepts]: Start accepts. Automaton has 3175 states and 3798 transitions. Word has length 157 [2023-11-29 01:17:55,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:55,348 INFO L495 AbstractCegarLoop]: Abstraction has 3175 states and 3798 transitions. [2023-11-29 01:17:55,348 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:55,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3175 states and 3798 transitions. [2023-11-29 01:17:55,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:55,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:55,351 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:55,357 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:17:55,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:55,551 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:55,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:55,552 INFO L85 PathProgramCache]: Analyzing trace with hash -429586727, now seen corresponding path program 1 times [2023-11-29 01:17:55,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:55,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249121336] [2023-11-29 01:17:55,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:55,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:56,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:56,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:56,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:56,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:56,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:56,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:56,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:56,309 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:56,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:56,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249121336] [2023-11-29 01:17:56,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249121336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:56,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:56,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:17:56,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021147129] [2023-11-29 01:17:56,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:56,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:17:56,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:56,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:17:56,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:17:56,311 INFO L87 Difference]: Start difference. First operand 3175 states and 3798 transitions. Second operand has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:56,910 INFO L93 Difference]: Finished difference Result 4894 states and 5869 transitions. [2023-11-29 01:17:56,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 01:17:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-11-29 01:17:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:56,916 INFO L225 Difference]: With dead ends: 4894 [2023-11-29 01:17:56,917 INFO L226 Difference]: Without dead ends: 3437 [2023-11-29 01:17:56,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:17:56,919 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 238 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:56,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 691 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:56,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3437 states. [2023-11-29 01:17:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3437 to 3133. [2023-11-29 01:17:57,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2905 states have (on average 1.1652323580034423) internal successors, (3385), 2917 states have internal predecessors, (3385), 180 states have call successors, (180), 47 states have call predecessors, (180), 47 states have return successors, (180), 168 states have call predecessors, (180), 180 states have call successors, (180) [2023-11-29 01:17:57,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 3745 transitions. [2023-11-29 01:17:57,078 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 3745 transitions. Word has length 157 [2023-11-29 01:17:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:57,079 INFO L495 AbstractCegarLoop]: Abstraction has 3133 states and 3745 transitions. [2023-11-29 01:17:57,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.666666666666667) internal successors, (60), 10 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:17:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 3745 transitions. [2023-11-29 01:17:57,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:57,081 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:57,081 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:57,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 01:17:57,081 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:57,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:57,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1728703307, now seen corresponding path program 1 times [2023-11-29 01:17:57,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:57,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236583800] [2023-11-29 01:17:57,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:57,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:57,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:57,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:57,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:57,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:57,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:57,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:57,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:57,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:57,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:57,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:57,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:57,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,564 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 01:17:57,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236583800] [2023-11-29 01:17:57,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236583800] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:17:57,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977000947] [2023-11-29 01:17:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:57,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:17:57,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:17:57,566 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:17:57,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:17:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:57,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 01:17:57,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:17:57,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 47 [2023-11-29 01:17:58,049 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:17:58,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 32 [2023-11-29 01:17:58,112 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:58,112 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:17:58,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977000947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:58,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:17:58,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 15 [2023-11-29 01:17:58,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954618361] [2023-11-29 01:17:58,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:58,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:17:58,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:58,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:17:58,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:17:58,114 INFO L87 Difference]: Start difference. First operand 3133 states and 3745 transitions. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:58,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:17:58,711 INFO L93 Difference]: Finished difference Result 5575 states and 6671 transitions. [2023-11-29 01:17:58,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 01:17:58,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:17:58,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:17:58,717 INFO L225 Difference]: With dead ends: 5575 [2023-11-29 01:17:58,717 INFO L226 Difference]: Without dead ends: 4160 [2023-11-29 01:17:58,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=319, Unknown=0, NotChecked=0, Total=380 [2023-11-29 01:17:58,720 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:17:58,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 675 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:17:58,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4160 states. [2023-11-29 01:17:58,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4160 to 2972. [2023-11-29 01:17:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2845 states have (on average 1.161335676625659) internal successors, (3304), 2851 states have internal predecessors, (3304), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:17:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 3504 transitions. [2023-11-29 01:17:58,832 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 3504 transitions. Word has length 157 [2023-11-29 01:17:58,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:17:58,832 INFO L495 AbstractCegarLoop]: Abstraction has 2972 states and 3504 transitions. [2023-11-29 01:17:58,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:17:58,832 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 3504 transitions. [2023-11-29 01:17:58,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:17:58,836 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:17:58,836 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:17:58,842 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 01:17:59,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-29 01:17:59,036 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:17:59,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:17:59,037 INFO L85 PathProgramCache]: Analyzing trace with hash 46304055, now seen corresponding path program 1 times [2023-11-29 01:17:59,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:17:59,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182653565] [2023-11-29 01:17:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:17:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:17:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:17:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:17:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:17:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:17:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:17:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:17:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:17:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:17:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:17:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:17:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:17:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:17:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:17:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:17:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:17:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:17:59,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:17:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:17:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:17:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:17:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:17:59,724 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:17:59,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:17:59,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182653565] [2023-11-29 01:17:59,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182653565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:17:59,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:17:59,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:17:59,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939128026] [2023-11-29 01:17:59,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:17:59,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:17:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:17:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:17:59,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:17:59,726 INFO L87 Difference]: Start difference. First operand 2972 states and 3504 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:00,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:00,146 INFO L93 Difference]: Finished difference Result 5242 states and 6193 transitions. [2023-11-29 01:18:00,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:18:00,147 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-11-29 01:18:00,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:00,153 INFO L225 Difference]: With dead ends: 5242 [2023-11-29 01:18:00,153 INFO L226 Difference]: Without dead ends: 3205 [2023-11-29 01:18:00,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:18:00,156 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 120 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:00,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 483 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:18:00,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2023-11-29 01:18:00,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 2871. [2023-11-29 01:18:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2744 states have (on average 1.1610787172011663) internal successors, (3186), 2750 states have internal predecessors, (3186), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:18:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 3386 transitions. [2023-11-29 01:18:00,312 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 3386 transitions. Word has length 157 [2023-11-29 01:18:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:00,312 INFO L495 AbstractCegarLoop]: Abstraction has 2871 states and 3386 transitions. [2023-11-29 01:18:00,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 3386 transitions. [2023-11-29 01:18:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:18:00,316 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:00,316 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:00,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 01:18:00,316 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:00,317 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:00,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1588154697, now seen corresponding path program 1 times [2023-11-29 01:18:00,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:00,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010592595] [2023-11-29 01:18:00,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:00,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:01,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:01,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:01,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:01,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:01,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:01,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:01,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:01,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:01,327 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:01,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:01,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010592595] [2023-11-29 01:18:01,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010592595] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:01,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:01,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:18:01,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601031526] [2023-11-29 01:18:01,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:01,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:18:01,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:01,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:18:01,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:01,328 INFO L87 Difference]: Start difference. First operand 2871 states and 3386 transitions. Second operand has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:01,700 INFO L93 Difference]: Finished difference Result 4996 states and 5898 transitions. [2023-11-29 01:18:01,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:18:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 157 [2023-11-29 01:18:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:01,705 INFO L225 Difference]: With dead ends: 4996 [2023-11-29 01:18:01,705 INFO L226 Difference]: Without dead ends: 3060 [2023-11-29 01:18:01,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:18:01,707 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 114 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:01,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 617 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 01:18:01,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2023-11-29 01:18:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2679. [2023-11-29 01:18:01,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2679 states, 2552 states have (on average 1.1598746081504703) internal successors, (2960), 2558 states have internal predecessors, (2960), 100 states have call successors, (100), 26 states have call predecessors, (100), 26 states have return successors, (100), 94 states have call predecessors, (100), 100 states have call successors, (100) [2023-11-29 01:18:01,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2679 states to 2679 states and 3160 transitions. [2023-11-29 01:18:01,814 INFO L78 Accepts]: Start accepts. Automaton has 2679 states and 3160 transitions. Word has length 157 [2023-11-29 01:18:01,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:01,814 INFO L495 AbstractCegarLoop]: Abstraction has 2679 states and 3160 transitions. [2023-11-29 01:18:01,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.0) internal successors, (60), 7 states have internal predecessors, (60), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:01,815 INFO L276 IsEmpty]: Start isEmpty. Operand 2679 states and 3160 transitions. [2023-11-29 01:18:01,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2023-11-29 01:18:01,817 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:01,818 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:01,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 01:18:01,818 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:01,818 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:01,818 INFO L85 PathProgramCache]: Analyzing trace with hash 186852665, now seen corresponding path program 1 times [2023-11-29 01:18:01,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:01,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008432555] [2023-11-29 01:18:01,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:01,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:02,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:02,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2023-11-29 01:18:02,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008432555] [2023-11-29 01:18:02,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008432555] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:18:02,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100988196] [2023-11-29 01:18:02,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:02,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:18:02,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:18:02,331 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:18:02,334 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:18:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:02,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 01:18:02,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:18:02,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 01:18:02,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 26 [2023-11-29 01:18:02,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-11-29 01:18:02,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2023-11-29 01:18:02,658 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:18:02,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 71 [2023-11-29 01:18:03,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:18:03,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 109 treesize of output 49 [2023-11-29 01:18:03,092 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:03,092 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 01:18:03,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100988196] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:03,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 01:18:03,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 16 [2023-11-29 01:18:03,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212538384] [2023-11-29 01:18:03,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:03,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:18:03,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:03,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:18:03,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2023-11-29 01:18:03,093 INFO L87 Difference]: Start difference. First operand 2679 states and 3160 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:04,115 INFO L93 Difference]: Finished difference Result 4881 states and 5782 transitions. [2023-11-29 01:18:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 01:18:04,116 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 157 [2023-11-29 01:18:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:04,121 INFO L225 Difference]: With dead ends: 4881 [2023-11-29 01:18:04,121 INFO L226 Difference]: Without dead ends: 3046 [2023-11-29 01:18:04,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2023-11-29 01:18:04,124 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 251 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 678 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:04,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 678 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:18:04,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3046 states. [2023-11-29 01:18:04,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3046 to 2661. [2023-11-29 01:18:04,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2435 states have (on average 1.153593429158111) internal successors, (2809), 2448 states have internal predecessors, (2809), 178 states have call successors, (178), 47 states have call predecessors, (178), 47 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2023-11-29 01:18:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 3165 transitions. [2023-11-29 01:18:04,398 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 3165 transitions. Word has length 157 [2023-11-29 01:18:04,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:04,398 INFO L495 AbstractCegarLoop]: Abstraction has 2661 states and 3165 transitions. [2023-11-29 01:18:04,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:04,399 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 3165 transitions. [2023-11-29 01:18:04,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:04,402 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:04,402 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:04,408 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:18:04,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_501b05d2-7491-4d1f-97e2-cec06d9a1e72/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2023-11-29 01:18:04,603 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:04,603 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:04,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1458783158, now seen corresponding path program 1 times [2023-11-29 01:18:04,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:04,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451951370] [2023-11-29 01:18:04,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:04,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:04,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:05,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:05,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:05,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:05,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:05,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:05,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:05,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:05,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:05,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:05,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:05,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:05,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:05,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:05,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451951370] [2023-11-29 01:18:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451951370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:05,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:05,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:18:05,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086685374] [2023-11-29 01:18:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:05,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:18:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:18:05,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:18:05,205 INFO L87 Difference]: Start difference. First operand 2661 states and 3165 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:05,983 INFO L93 Difference]: Finished difference Result 5151 states and 6163 transitions. [2023-11-29 01:18:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:18:05,984 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-11-29 01:18:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:05,988 INFO L225 Difference]: With dead ends: 5151 [2023-11-29 01:18:05,988 INFO L226 Difference]: Without dead ends: 3003 [2023-11-29 01:18:05,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:18:05,992 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 226 mSDsluCounter, 1026 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:05,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1223 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:18:05,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2023-11-29 01:18:06,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2677. [2023-11-29 01:18:06,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2451 states have (on average 1.1525907792737657) internal successors, (2825), 2464 states have internal predecessors, (2825), 178 states have call successors, (178), 47 states have call predecessors, (178), 47 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2023-11-29 01:18:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3181 transitions. [2023-11-29 01:18:06,269 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3181 transitions. Word has length 159 [2023-11-29 01:18:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:06,270 INFO L495 AbstractCegarLoop]: Abstraction has 2677 states and 3181 transitions. [2023-11-29 01:18:06,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:06,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3181 transitions. [2023-11-29 01:18:06,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:06,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:06,273 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:06,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 01:18:06,274 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:06,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1851810168, now seen corresponding path program 1 times [2023-11-29 01:18:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:06,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373756423] [2023-11-29 01:18:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:06,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:06,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:06,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:06,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:06,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:06,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:06,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:06,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373756423] [2023-11-29 01:18:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373756423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:06,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:18:06,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025147624] [2023-11-29 01:18:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:06,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:18:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:06,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:18:06,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:18:06,963 INFO L87 Difference]: Start difference. First operand 2677 states and 3181 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:07,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:07,467 INFO L93 Difference]: Finished difference Result 5001 states and 5943 transitions. [2023-11-29 01:18:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:18:07,467 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-11-29 01:18:07,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:07,470 INFO L225 Difference]: With dead ends: 5001 [2023-11-29 01:18:07,470 INFO L226 Difference]: Without dead ends: 2837 [2023-11-29 01:18:07,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:07,473 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 82 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:07,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 467 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:18:07,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2837 states. [2023-11-29 01:18:07,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2837 to 2677. [2023-11-29 01:18:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2677 states, 2450 states have (on average 1.1510204081632653) internal successors, (2820), 2463 states have internal predecessors, (2820), 178 states have call successors, (178), 48 states have call predecessors, (178), 48 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2023-11-29 01:18:07,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2677 states to 2677 states and 3176 transitions. [2023-11-29 01:18:07,665 INFO L78 Accepts]: Start accepts. Automaton has 2677 states and 3176 transitions. Word has length 159 [2023-11-29 01:18:07,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:07,665 INFO L495 AbstractCegarLoop]: Abstraction has 2677 states and 3176 transitions. [2023-11-29 01:18:07,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:07,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2677 states and 3176 transitions. [2023-11-29 01:18:07,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:07,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:07,668 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:07,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 01:18:07,668 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:07,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 499051555, now seen corresponding path program 1 times [2023-11-29 01:18:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:07,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406880629] [2023-11-29 01:18:07,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:07,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:07,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:07,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:07,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:07,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:07,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:07,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:07,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406880629] [2023-11-29 01:18:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406880629] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:07,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 01:18:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887557012] [2023-11-29 01:18:07,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:07,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:18:07,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:07,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:18:07,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:18:07,837 INFO L87 Difference]: Start difference. First operand 2677 states and 3176 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:08,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:08,047 INFO L93 Difference]: Finished difference Result 2721 states and 3233 transitions. [2023-11-29 01:18:08,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:18:08,048 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-11-29 01:18:08,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:08,052 INFO L225 Difference]: With dead ends: 2721 [2023-11-29 01:18:08,052 INFO L226 Difference]: Without dead ends: 2719 [2023-11-29 01:18:08,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:18:08,053 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 7 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:08,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 550 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 01:18:08,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2719 states. [2023-11-29 01:18:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2719 to 2719. [2023-11-29 01:18:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2719 states, 2492 states have (on average 1.1484751203852328) internal successors, (2862), 2505 states have internal predecessors, (2862), 178 states have call successors, (178), 48 states have call predecessors, (178), 48 states have return successors, (178), 165 states have call predecessors, (178), 178 states have call successors, (178) [2023-11-29 01:18:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2719 states to 2719 states and 3218 transitions. [2023-11-29 01:18:08,291 INFO L78 Accepts]: Start accepts. Automaton has 2719 states and 3218 transitions. Word has length 159 [2023-11-29 01:18:08,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:08,292 INFO L495 AbstractCegarLoop]: Abstraction has 2719 states and 3218 transitions. [2023-11-29 01:18:08,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:08,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2719 states and 3218 transitions. [2023-11-29 01:18:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:08,295 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:08,295 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:08,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 01:18:08,296 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:08,296 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:08,296 INFO L85 PathProgramCache]: Analyzing trace with hash -1829177914, now seen corresponding path program 1 times [2023-11-29 01:18:08,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:08,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976092103] [2023-11-29 01:18:08,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:08,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:08,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:09,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:09,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:09,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:09,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:09,321 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:09,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:09,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976092103] [2023-11-29 01:18:09,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976092103] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:09,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:09,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 01:18:09,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409675147] [2023-11-29 01:18:09,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:09,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:18:09,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:09,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:18:09,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:18:09,323 INFO L87 Difference]: Start difference. First operand 2719 states and 3218 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:10,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:10,628 INFO L93 Difference]: Finished difference Result 5105 states and 6036 transitions. [2023-11-29 01:18:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 01:18:10,629 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-11-29 01:18:10,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:10,633 INFO L225 Difference]: With dead ends: 5105 [2023-11-29 01:18:10,634 INFO L226 Difference]: Without dead ends: 2903 [2023-11-29 01:18:10,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2023-11-29 01:18:10,638 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 335 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 1075 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 945 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1075 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:10,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 945 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1075 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 01:18:10,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2903 states. [2023-11-29 01:18:10,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2903 to 2691. [2023-11-29 01:18:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2691 states, 2448 states have (on average 1.1454248366013071) internal successors, (2804), 2463 states have internal predecessors, (2804), 190 states have call successors, (190), 52 states have call predecessors, (190), 52 states have return successors, (190), 175 states have call predecessors, (190), 190 states have call successors, (190) [2023-11-29 01:18:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 3184 transitions. [2023-11-29 01:18:10,965 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 3184 transitions. Word has length 159 [2023-11-29 01:18:10,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:10,965 INFO L495 AbstractCegarLoop]: Abstraction has 2691 states and 3184 transitions. [2023-11-29 01:18:10,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:10,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 3184 transitions. [2023-11-29 01:18:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:10,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:10,968 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:10,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-11-29 01:18:10,968 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:10,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:10,968 INFO L85 PathProgramCache]: Analyzing trace with hash -770688232, now seen corresponding path program 1 times [2023-11-29 01:18:10,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:10,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215280539] [2023-11-29 01:18:10,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:10,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:11,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:11,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:11,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:11,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:11,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215280539] [2023-11-29 01:18:11,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215280539] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:11,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:11,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 01:18:11,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478536591] [2023-11-29 01:18:11,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:11,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 01:18:11,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:11,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 01:18:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2023-11-29 01:18:11,965 INFO L87 Difference]: Start difference. First operand 2691 states and 3184 transitions. Second operand has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:13,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:13,199 INFO L93 Difference]: Finished difference Result 4989 states and 5900 transitions. [2023-11-29 01:18:13,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 01:18:13,199 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-11-29 01:18:13,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:13,203 INFO L225 Difference]: With dead ends: 4989 [2023-11-29 01:18:13,203 INFO L226 Difference]: Without dead ends: 2797 [2023-11-29 01:18:13,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=304, Unknown=0, NotChecked=0, Total=420 [2023-11-29 01:18:13,207 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 325 mSDsluCounter, 1091 mSDsCounter, 0 mSdLazyCounter, 1166 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1283 SdHoareTripleChecker+Invalid, 1254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:13,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1283 Invalid, 1254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1166 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 01:18:13,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2797 states. [2023-11-29 01:18:13,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2797 to 2595. [2023-11-29 01:18:13,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2595 states, 2352 states have (on average 1.1428571428571428) internal successors, (2688), 2367 states have internal predecessors, (2688), 190 states have call successors, (190), 52 states have call predecessors, (190), 52 states have return successors, (190), 175 states have call predecessors, (190), 190 states have call successors, (190) [2023-11-29 01:18:13,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 3068 transitions. [2023-11-29 01:18:13,464 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 3068 transitions. Word has length 159 [2023-11-29 01:18:13,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:13,465 INFO L495 AbstractCegarLoop]: Abstraction has 2595 states and 3068 transitions. [2023-11-29 01:18:13,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.166666666666667) internal successors, (62), 13 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:13,465 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 3068 transitions. [2023-11-29 01:18:13,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:13,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:13,468 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 01:18:13,469 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:13,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash -400293476, now seen corresponding path program 1 times [2023-11-29 01:18:13,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:13,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223723336] [2023-11-29 01:18:13,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:14,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:14,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:14,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:14,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:14,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:14,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:14,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:14,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:14,074 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:14,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:14,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223723336] [2023-11-29 01:18:14,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223723336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:14,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:14,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 01:18:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499380528] [2023-11-29 01:18:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:14,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 01:18:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 01:18:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:18:14,076 INFO L87 Difference]: Start difference. First operand 2595 states and 3068 transitions. Second operand has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:14,840 INFO L93 Difference]: Finished difference Result 4891 states and 5802 transitions. [2023-11-29 01:18:14,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 01:18:14,840 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 159 [2023-11-29 01:18:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:14,844 INFO L225 Difference]: With dead ends: 4891 [2023-11-29 01:18:14,844 INFO L226 Difference]: Without dead ends: 2777 [2023-11-29 01:18:14,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-29 01:18:14,847 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 226 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:14,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1310 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:18:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2777 states. [2023-11-29 01:18:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2777 to 2427. [2023-11-29 01:18:15,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2427 states, 2230 states have (on average 1.1452914798206277) internal successors, (2554), 2241 states have internal predecessors, (2554), 154 states have call successors, (154), 42 states have call predecessors, (154), 42 states have return successors, (154), 143 states have call predecessors, (154), 154 states have call successors, (154) [2023-11-29 01:18:15,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2427 states to 2427 states and 2862 transitions. [2023-11-29 01:18:15,030 INFO L78 Accepts]: Start accepts. Automaton has 2427 states and 2862 transitions. Word has length 159 [2023-11-29 01:18:15,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:15,030 INFO L495 AbstractCegarLoop]: Abstraction has 2427 states and 2862 transitions. [2023-11-29 01:18:15,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.2) internal successors, (62), 10 states have internal predecessors, (62), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:15,030 INFO L276 IsEmpty]: Start isEmpty. Operand 2427 states and 2862 transitions. [2023-11-29 01:18:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2023-11-29 01:18:15,032 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:15,032 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:15,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2023-11-29 01:18:15,033 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:15,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:15,033 INFO L85 PathProgramCache]: Analyzing trace with hash -793320486, now seen corresponding path program 1 times [2023-11-29 01:18:15,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:15,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345546055] [2023-11-29 01:18:15,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:15,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:15,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:15,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:15,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:15,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:15,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:15,500 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:15,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:15,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345546055] [2023-11-29 01:18:15,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345546055] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:15,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:15,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:18:15,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574407711] [2023-11-29 01:18:15,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:15,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:18:15,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:15,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:18:15,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:18:15,502 INFO L87 Difference]: Start difference. First operand 2427 states and 2862 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:15,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:15,955 INFO L93 Difference]: Finished difference Result 4369 states and 5139 transitions. [2023-11-29 01:18:15,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:18:15,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 159 [2023-11-29 01:18:15,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:15,958 INFO L225 Difference]: With dead ends: 4369 [2023-11-29 01:18:15,958 INFO L226 Difference]: Without dead ends: 2423 [2023-11-29 01:18:15,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:15,961 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 136 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:15,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 534 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:18:15,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2423 states. [2023-11-29 01:18:16,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2423 to 2211. [2023-11-29 01:18:16,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2211 states, 2064 states have (on average 1.1453488372093024) internal successors, (2364), 2071 states have internal predecessors, (2364), 114 states have call successors, (114), 32 states have call predecessors, (114), 32 states have return successors, (114), 107 states have call predecessors, (114), 114 states have call successors, (114) [2023-11-29 01:18:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 2592 transitions. [2023-11-29 01:18:16,113 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 2592 transitions. Word has length 159 [2023-11-29 01:18:16,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:16,113 INFO L495 AbstractCegarLoop]: Abstraction has 2211 states and 2592 transitions. [2023-11-29 01:18:16,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:16,113 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 2592 transitions. [2023-11-29 01:18:16,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2023-11-29 01:18:16,115 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:16,115 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:16,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2023-11-29 01:18:16,115 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:16,116 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:16,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1145736066, now seen corresponding path program 1 times [2023-11-29 01:18:16,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:16,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710059014] [2023-11-29 01:18:16,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:16,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:17,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:17,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:17,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:17,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:17,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710059014] [2023-11-29 01:18:17,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710059014] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:17,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:17,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:18:17,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595704231] [2023-11-29 01:18:17,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:17,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:18:17,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:17,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:18:17,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:17,125 INFO L87 Difference]: Start difference. First operand 2211 states and 2592 transitions. Second operand has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:18:17,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:17,865 INFO L93 Difference]: Finished difference Result 5889 states and 6854 transitions. [2023-11-29 01:18:17,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:18:17,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) Word has length 161 [2023-11-29 01:18:17,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:17,869 INFO L225 Difference]: With dead ends: 5889 [2023-11-29 01:18:17,869 INFO L226 Difference]: Without dead ends: 4159 [2023-11-29 01:18:17,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:18:17,872 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 58 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:17,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 523 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 01:18:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4159 states. [2023-11-29 01:18:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4159 to 4155. [2023-11-29 01:18:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4155 states, 3936 states have (on average 1.1392276422764227) internal successors, (4484), 3951 states have internal predecessors, (4484), 170 states have call successors, (170), 48 states have call predecessors, (170), 48 states have return successors, (170), 155 states have call predecessors, (170), 170 states have call successors, (170) [2023-11-29 01:18:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 4824 transitions. [2023-11-29 01:18:18,137 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 4824 transitions. Word has length 161 [2023-11-29 01:18:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:18,137 INFO L495 AbstractCegarLoop]: Abstraction has 4155 states and 4824 transitions. [2023-11-29 01:18:18,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.8) internal successors, (64), 7 states have internal predecessors, (64), 3 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 01:18:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 4824 transitions. [2023-11-29 01:18:18,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 01:18:18,141 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:18,141 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:18,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2023-11-29 01:18:18,142 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:18,142 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:18,142 INFO L85 PathProgramCache]: Analyzing trace with hash 2001798785, now seen corresponding path program 1 times [2023-11-29 01:18:18,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:18,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963027669] [2023-11-29 01:18:18,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:18,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:18,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:18,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:18,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:18,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:18,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:18,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:18,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:18,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:18,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:18,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:18,525 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:18,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:18,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963027669] [2023-11-29 01:18:18,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963027669] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:18,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:18,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 01:18:18,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943062720] [2023-11-29 01:18:18,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:18,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:18:18,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:18,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:18:18,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:18:18,526 INFO L87 Difference]: Start difference. First operand 4155 states and 4824 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:19,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:19,250 INFO L93 Difference]: Finished difference Result 6286 states and 7300 transitions. [2023-11-29 01:18:19,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 01:18:19,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 162 [2023-11-29 01:18:19,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:19,257 INFO L225 Difference]: With dead ends: 6286 [2023-11-29 01:18:19,257 INFO L226 Difference]: Without dead ends: 6284 [2023-11-29 01:18:19,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2023-11-29 01:18:19,258 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 97 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1038 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:19,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1038 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 01:18:19,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6284 states. [2023-11-29 01:18:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6284 to 5887. [2023-11-29 01:18:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5887 states, 5668 states have (on average 1.141848976711362) internal successors, (6472), 5683 states have internal predecessors, (6472), 170 states have call successors, (170), 48 states have call predecessors, (170), 48 states have return successors, (170), 155 states have call predecessors, (170), 170 states have call successors, (170) [2023-11-29 01:18:19,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5887 states to 5887 states and 6812 transitions. [2023-11-29 01:18:19,547 INFO L78 Accepts]: Start accepts. Automaton has 5887 states and 6812 transitions. Word has length 162 [2023-11-29 01:18:19,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:19,547 INFO L495 AbstractCegarLoop]: Abstraction has 5887 states and 6812 transitions. [2023-11-29 01:18:19,547 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 01:18:19,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5887 states and 6812 transitions. [2023-11-29 01:18:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2023-11-29 01:18:19,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 01:18:19,553 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:18:19,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2023-11-29 01:18:19,553 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 01:18:19,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:18:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1157793283, now seen corresponding path program 1 times [2023-11-29 01:18:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:18:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062776642] [2023-11-29 01:18:19,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:18:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:18:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 01:18:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 01:18:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 01:18:20,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 01:18:20,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 01:18:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 01:18:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 01:18:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 01:18:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 01:18:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 01:18:20,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 01:18:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 01:18:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 01:18:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 01:18:20,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 01:18:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 01:18:20,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 01:18:20,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 01:18:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 01:18:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 01:18:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:18:20,379 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 01:18:20,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:18:20,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062776642] [2023-11-29 01:18:20,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062776642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:18:20,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:18:20,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:18:20,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715002266] [2023-11-29 01:18:20,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:18:20,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:18:20,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:18:20,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:18:20,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:18:20,380 INFO L87 Difference]: Start difference. First operand 5887 states and 6812 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:21,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 01:18:21,497 INFO L93 Difference]: Finished difference Result 10716 states and 12370 transitions. [2023-11-29 01:18:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 01:18:21,498 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2023-11-29 01:18:21,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 01:18:21,498 INFO L225 Difference]: With dead ends: 10716 [2023-11-29 01:18:21,498 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 01:18:21,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-11-29 01:18:21,506 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 93 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 822 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 01:18:21,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 780 Invalid, 822 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 01:18:21,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 01:18:21,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 01:18:21,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:18:21,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 01:18:21,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 162 [2023-11-29 01:18:21,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 01:18:21,508 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 01:18:21,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 01:18:21,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 01:18:21,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 01:18:21,511 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 01:18:21,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2023-11-29 01:18:21,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 01:26:24,664 WARN L293 SmtUtils]: Spent 7.92m on a formula simplification. DAG size of input: 433 DAG size of output: 531 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:26:46,119 WARN L293 SmtUtils]: Spent 12.84s on a formula simplification. DAG size of input: 209 DAG size of output: 160 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:26:59,494 WARN L293 SmtUtils]: Spent 13.20s on a formula simplification. DAG size of input: 200 DAG size of output: 168 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:27:27,224 WARN L293 SmtUtils]: Spent 27.66s on a formula simplification. DAG size of input: 203 DAG size of output: 214 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:27:55,119 WARN L293 SmtUtils]: Spent 27.83s on a formula simplification. DAG size of input: 203 DAG size of output: 216 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:28:07,827 WARN L293 SmtUtils]: Spent 12.71s on a formula simplification. DAG size of input: 200 DAG size of output: 168 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:28:25,369 WARN L293 SmtUtils]: Spent 12.53s on a formula simplification. DAG size of input: 221 DAG size of output: 172 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:28:42,626 WARN L293 SmtUtils]: Spent 12.68s on a formula simplification. DAG size of input: 200 DAG size of output: 168 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:28:55,098 WARN L293 SmtUtils]: Spent 12.46s on a formula simplification. DAG size of input: 221 DAG size of output: 172 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:29:25,034 WARN L293 SmtUtils]: Spent 28.18s on a formula simplification. DAG size of input: 203 DAG size of output: 214 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:30:48,912 WARN L293 SmtUtils]: Spent 1.33m on a formula simplification. DAG size of input: 206 DAG size of output: 263 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or) [2023-11-29 01:31:04,264 WARN L293 SmtUtils]: Spent 12.12s on a formula simplification. DAG size of input: 209 DAG size of output: 160 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)