./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/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_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/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_3412c319-c54e-4b68-8ba7-071a4169d6bd/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 6bdaf076d843757cd349145aa22062c93bd9b98b715a11ab9b45e3c6c7d41988 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:10:06,304 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:10:06,367 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 02:10:06,372 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:10:06,372 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:10:06,396 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:10:06,397 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:10:06,397 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:10:06,398 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:10:06,399 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:10:06,399 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:10:06,400 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:10:06,400 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:10:06,401 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:10:06,401 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:10:06,402 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:10:06,403 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:10:06,403 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:10:06,403 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:10:06,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:10:06,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:10:06,405 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:10:06,406 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:10:06,406 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:10:06,407 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:10:06,407 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:10:06,408 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:10:06,408 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:10:06,409 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:10:06,409 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:10:06,409 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:10:06,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:10:06,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:10:06,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:10:06,410 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:10:06,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:10:06,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:10:06,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:10:06,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:10:06,411 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:10:06,412 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:10:06,412 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:10:06,412 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_3412c319-c54e-4b68-8ba7-071a4169d6bd/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_3412c319-c54e-4b68-8ba7-071a4169d6bd/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 -> 6bdaf076d843757cd349145aa22062c93bd9b98b715a11ab9b45e3c6c7d41988 [2023-11-29 02:10:06,611 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:10:06,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:10:06,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:10:06,652 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:10:06,652 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:10:06,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i [2023-11-29 02:10:09,347 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:10:09,524 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:10:09,524 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i [2023-11-29 02:10:09,534 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/data/c66d09084/14f0e70e54b148feb341158d7fc0b7ee/FLAG5c6c7dc96 [2023-11-29 02:10:09,548 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/data/c66d09084/14f0e70e54b148feb341158d7fc0b7ee [2023-11-29 02:10:09,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:10:09,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:10:09,553 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:10:09,553 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:10:09,559 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:10:09,559 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,560 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b0f6c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09, skipping insertion in model container [2023-11-29 02:10:09,561 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,590 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:10:09,734 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_3412c319-c54e-4b68-8ba7-071a4169d6bd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i[917,930] [2023-11-29 02:10:09,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:10:09,805 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:10:09,817 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_3412c319-c54e-4b68-8ba7-071a4169d6bd/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-32.i[917,930] [2023-11-29 02:10:09,851 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:10:09,871 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:10:09,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09 WrapperNode [2023-11-29 02:10:09,872 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:10:09,873 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:10:09,873 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:10:09,873 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:10:09,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,893 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,934 INFO L138 Inliner]: procedures = 26, calls = 154, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 390 [2023-11-29 02:10:09,934 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:10:09,935 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:10:09,935 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:10:09,935 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:10:09,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,953 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,975 INFO L175 MemorySlicer]: Split 124 memory accesses to 2 slices as follows [2, 122]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 15 writes are split as follows [0, 15]. [2023-11-29 02:10:09,975 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,992 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:09,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:10,002 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:10,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:10:10,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:10:10,008 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:10:10,008 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:10:10,009 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (1/1) ... [2023-11-29 02:10:10,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:10:10,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:10:10,038 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:10:10,049 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:10:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:10:10,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:10:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:10:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:10:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:10:10,081 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 02:10:10,081 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 02:10:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:10:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:10:10,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:10:10,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:10:10,194 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:10:10,197 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:10:10,600 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:10:10,628 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:10:10,629 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:10:10,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:10:10 BoogieIcfgContainer [2023-11-29 02:10:10,629 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:10:10,631 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:10:10,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:10:10,634 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:10:10,634 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:10:09" (1/3) ... [2023-11-29 02:10:10,634 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc73cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:10:10, skipping insertion in model container [2023-11-29 02:10:10,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:10:09" (2/3) ... [2023-11-29 02:10:10,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cc73cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:10:10, skipping insertion in model container [2023-11-29 02:10:10,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:10:10" (3/3) ... [2023-11-29 02:10:10,636 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-32.i [2023-11-29 02:10:10,651 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:10:10,651 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 02:10:10,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:10:10,699 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;@29ac3406, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:10:10,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 02:10:10,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 02:10:10,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 02:10:10,716 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:10,717 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:10,717 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:10,722 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:10,722 INFO L85 PathProgramCache]: Analyzing trace with hash -403307072, now seen corresponding path program 1 times [2023-11-29 02:10:10,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:10,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093038745] [2023-11-29 02:10:10,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:10,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:11,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:11,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:11,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:11,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:11,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:11,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:11,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:11,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:11,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,100 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:11,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:11,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093038745] [2023-11-29 02:10:11,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093038745] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:11,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:11,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:10:11,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132343878] [2023-11-29 02:10:11,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:11,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 02:10:11,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:11,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 02:10:11,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 02:10:11,135 INFO L87 Difference]: Start difference. First operand has 92 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:10:11,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:11,176 INFO L93 Difference]: Finished difference Result 181 states and 288 transitions. [2023-11-29 02:10:11,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 02:10:11,178 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 124 [2023-11-29 02:10:11,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:11,185 INFO L225 Difference]: With dead ends: 181 [2023-11-29 02:10:11,186 INFO L226 Difference]: Without dead ends: 90 [2023-11-29 02:10:11,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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 02:10:11,192 INFO L413 NwaCegarLoop]: 123 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, 123 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 02:10:11,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 123 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:10:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-11-29 02:10:11,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2023-11-29 02:10:11,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3) internal successors, (91), 70 states have internal predecessors, (91), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 02:10:11,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2023-11-29 02:10:11,235 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 124 [2023-11-29 02:10:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:11,235 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2023-11-29 02:10:11,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:10:11,236 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2023-11-29 02:10:11,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2023-11-29 02:10:11,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:11,239 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:11,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:10:11,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:11,241 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:11,241 INFO L85 PathProgramCache]: Analyzing trace with hash 851464092, now seen corresponding path program 1 times [2023-11-29 02:10:11,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:11,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027312468] [2023-11-29 02:10:11,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:11,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:11,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:11,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:11,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:11,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:11,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:11,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:11,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:11,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:11,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:11,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:11,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:11,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:11,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:11,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027312468] [2023-11-29 02:10:11,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027312468] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:11,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:11,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:10:11,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908702571] [2023-11-29 02:10:11,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:11,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:10:11,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:11,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:10:11,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:10:11,611 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:11,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:11,872 INFO L93 Difference]: Finished difference Result 269 states and 380 transitions. [2023-11-29 02:10:11,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:10:11,873 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2023-11-29 02:10:11,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:11,876 INFO L225 Difference]: With dead ends: 269 [2023-11-29 02:10:11,876 INFO L226 Difference]: Without dead ends: 180 [2023-11-29 02:10:11,878 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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 02:10:11,879 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 89 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:11,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 285 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:10:11,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-29 02:10:11,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 150. [2023-11-29 02:10:11,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.2612612612612613) internal successors, (140), 111 states have internal predecessors, (140), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 212 transitions. [2023-11-29 02:10:11,909 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 212 transitions. Word has length 124 [2023-11-29 02:10:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:11,910 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 212 transitions. [2023-11-29 02:10:11,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:11,910 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 212 transitions. [2023-11-29 02:10:11,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 02:10:11,912 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:11,913 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:11,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:10:11,913 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:11,913 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:11,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2069130434, now seen corresponding path program 1 times [2023-11-29 02:10:11,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:11,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041783604] [2023-11-29 02:10:11,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:11,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:13,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:13,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:13,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:13,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:13,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:13,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:13,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:13,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:13,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:13,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:13,496 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:13,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:13,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041783604] [2023-11-29 02:10:13,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2041783604] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:13,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:13,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:10:13,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853184651] [2023-11-29 02:10:13,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:13,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 02:10:13,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:13,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 02:10:13,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:10:13,500 INFO L87 Difference]: Start difference. First operand 150 states and 212 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:14,810 INFO L93 Difference]: Finished difference Result 353 states and 504 transitions. [2023-11-29 02:10:14,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:10:14,811 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 132 [2023-11-29 02:10:14,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:14,814 INFO L225 Difference]: With dead ends: 353 [2023-11-29 02:10:14,814 INFO L226 Difference]: Without dead ends: 264 [2023-11-29 02:10:14,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2023-11-29 02:10:14,817 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 545 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:14,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 636 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:10:14,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2023-11-29 02:10:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 182. [2023-11-29 02:10:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.3146853146853146) internal successors, (188), 143 states have internal predecessors, (188), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2023-11-29 02:10:14,851 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 132 [2023-11-29 02:10:14,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:14,852 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2023-11-29 02:10:14,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 states have internal predecessors, (45), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:14,853 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2023-11-29 02:10:14,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 02:10:14,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:14,856 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:14,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:10:14,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:14,857 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:14,857 INFO L85 PathProgramCache]: Analyzing trace with hash 1466999230, now seen corresponding path program 1 times [2023-11-29 02:10:14,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:14,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405110606] [2023-11-29 02:10:14,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:14,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:14,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:16,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:16,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:16,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:16,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:16,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:16,772 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:16,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:16,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405110606] [2023-11-29 02:10:16,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [405110606] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:16,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:16,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:10:16,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408560066] [2023-11-29 02:10:16,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:16,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:10:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:16,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:10:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:10:16,775 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:10:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:18,723 INFO L93 Difference]: Finished difference Result 394 states and 562 transitions. [2023-11-29 02:10:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 02:10:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 133 [2023-11-29 02:10:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:18,727 INFO L225 Difference]: With dead ends: 394 [2023-11-29 02:10:18,727 INFO L226 Difference]: Without dead ends: 286 [2023-11-29 02:10:18,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=181, Invalid=575, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:10:18,729 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 502 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 502 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:18,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [502 Valid, 663 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:10:18,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-29 02:10:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 182. [2023-11-29 02:10:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 143 states have (on average 1.3146853146853146) internal successors, (188), 143 states have internal predecessors, (188), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:18,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 260 transitions. [2023-11-29 02:10:18,766 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 260 transitions. Word has length 133 [2023-11-29 02:10:18,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:18,767 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 260 transitions. [2023-11-29 02:10:18,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.2857142857142856) internal successors, (46), 14 states have internal predecessors, (46), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:10:18,768 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 260 transitions. [2023-11-29 02:10:18,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-29 02:10:18,770 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:18,770 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:18,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:10:18,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:18,771 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1454826587, now seen corresponding path program 1 times [2023-11-29 02:10:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:18,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341631428] [2023-11-29 02:10:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:18,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:23,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:23,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:23,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:23,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:23,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:23,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:23,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:23,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:23,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:23,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:23,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:23,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:23,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:23,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341631428] [2023-11-29 02:10:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341631428] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:23,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:23,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 02:10:23,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541842667] [2023-11-29 02:10:23,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:23,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:10:23,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:23,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:10:23,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:10:23,412 INFO L87 Difference]: Start difference. First operand 182 states and 260 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:26,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:26,982 INFO L93 Difference]: Finished difference Result 568 states and 809 transitions. [2023-11-29 02:10:26,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:10:26,982 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 134 [2023-11-29 02:10:26,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:26,985 INFO L225 Difference]: With dead ends: 568 [2023-11-29 02:10:26,986 INFO L226 Difference]: Without dead ends: 460 [2023-11-29 02:10:26,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=169, Invalid=643, Unknown=0, NotChecked=0, Total=812 [2023-11-29 02:10:26,987 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 425 mSDsluCounter, 1353 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 1554 SdHoareTripleChecker+Invalid, 1836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:26,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 1554 Invalid, 1836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 02:10:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-11-29 02:10:27,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 320. [2023-11-29 02:10:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 262 states have (on average 1.3396946564885497) internal successors, (351), 262 states have internal predecessors, (351), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:10:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 459 transitions. [2023-11-29 02:10:27,049 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 459 transitions. Word has length 134 [2023-11-29 02:10:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:27,050 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 459 transitions. [2023-11-29 02:10:27,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:27,050 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 459 transitions. [2023-11-29 02:10:27,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-29 02:10:27,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:27,053 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:27,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:10:27,053 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:27,053 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:27,054 INFO L85 PathProgramCache]: Analyzing trace with hash 546770519, now seen corresponding path program 1 times [2023-11-29 02:10:27,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:27,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410481390] [2023-11-29 02:10:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:27,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:27,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:27,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:27,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:27,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:27,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:27,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:27,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:27,257 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:27,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:27,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410481390] [2023-11-29 02:10:27,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410481390] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:27,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:27,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:10:27,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198732308] [2023-11-29 02:10:27,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:27,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:10:27,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:27,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:10:27,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:10:27,260 INFO L87 Difference]: Start difference. First operand 320 states and 459 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:27,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:27,342 INFO L93 Difference]: Finished difference Result 574 states and 823 transitions. [2023-11-29 02:10:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:10:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 134 [2023-11-29 02:10:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:27,346 INFO L225 Difference]: With dead ends: 574 [2023-11-29 02:10:27,346 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 02:10:27,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:10:27,348 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 60 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:27,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 454 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 02:10:27,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 02:10:27,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 326. [2023-11-29 02:10:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 268 states have (on average 1.3320895522388059) internal successors, (357), 268 states have internal predecessors, (357), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:10:27,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 465 transitions. [2023-11-29 02:10:27,407 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 465 transitions. Word has length 134 [2023-11-29 02:10:27,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:27,407 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 465 transitions. [2023-11-29 02:10:27,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:27,408 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 465 transitions. [2023-11-29 02:10:27,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2023-11-29 02:10:27,410 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:27,410 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:27,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:10:27,411 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:27,411 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:27,411 INFO L85 PathProgramCache]: Analyzing trace with hash 690554459, now seen corresponding path program 1 times [2023-11-29 02:10:27,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:27,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009379405] [2023-11-29 02:10:27,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:27,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:27,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:30,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:30,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:30,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:30,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:30,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:30,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:30,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:30,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:30,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:30,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:30,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:30,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:30,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009379405] [2023-11-29 02:10:30,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009379405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:30,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:30,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 02:10:30,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044674084] [2023-11-29 02:10:30,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:30,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:10:30,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:30,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:10:30,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:10:30,296 INFO L87 Difference]: Start difference. First operand 326 states and 465 transitions. Second operand has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:31,985 INFO L93 Difference]: Finished difference Result 722 states and 1019 transitions. [2023-11-29 02:10:31,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:10:31,985 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 134 [2023-11-29 02:10:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:31,989 INFO L225 Difference]: With dead ends: 722 [2023-11-29 02:10:31,989 INFO L226 Difference]: Without dead ends: 486 [2023-11-29 02:10:31,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=147, Invalid=503, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:10:31,991 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 519 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 520 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:31,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [520 Valid, 470 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:10:31,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2023-11-29 02:10:32,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 341. [2023-11-29 02:10:32,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 283 states have (on average 1.332155477031802) internal successors, (377), 283 states have internal predecessors, (377), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:10:32,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 485 transitions. [2023-11-29 02:10:32,034 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 485 transitions. Word has length 134 [2023-11-29 02:10:32,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:32,035 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 485 transitions. [2023-11-29 02:10:32,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 16 states have internal predecessors, (47), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:32,035 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 485 transitions. [2023-11-29 02:10:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-29 02:10:32,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:32,037 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:32,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:10:32,038 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:32,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:32,038 INFO L85 PathProgramCache]: Analyzing trace with hash -396550843, now seen corresponding path program 1 times [2023-11-29 02:10:32,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:32,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988646119] [2023-11-29 02:10:32,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:32,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:35,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:35,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:35,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:36,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:36,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:36,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:36,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:36,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:36,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:36,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:36,054 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:36,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:36,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988646119] [2023-11-29 02:10:36,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988646119] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:36,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:36,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-11-29 02:10:36,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643636325] [2023-11-29 02:10:36,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:36,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:10:36,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:36,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:10:36,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:10:36,057 INFO L87 Difference]: Start difference. First operand 341 states and 485 transitions. Second operand has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 02:10:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:38,468 INFO L93 Difference]: Finished difference Result 626 states and 883 transitions. [2023-11-29 02:10:38,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:10:38,469 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 135 [2023-11-29 02:10:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:38,472 INFO L225 Difference]: With dead ends: 626 [2023-11-29 02:10:38,472 INFO L226 Difference]: Without dead ends: 504 [2023-11-29 02:10:38,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2023-11-29 02:10:38,474 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 278 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 1361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:38,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 785 Invalid, 1361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:10:38,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2023-11-29 02:10:38,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 219. [2023-11-29 02:10:38,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 180 states have (on average 1.3444444444444446) internal successors, (242), 180 states have internal predecessors, (242), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:38,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 314 transitions. [2023-11-29 02:10:38,506 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 314 transitions. Word has length 135 [2023-11-29 02:10:38,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:38,507 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 314 transitions. [2023-11-29 02:10:38,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.2) internal successors, (48), 16 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 02:10:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 314 transitions. [2023-11-29 02:10:38,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2023-11-29 02:10:38,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:38,508 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:38,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:10:38,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:38,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:38,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1863052375, now seen corresponding path program 1 times [2023-11-29 02:10:38,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:38,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665999300] [2023-11-29 02:10:38,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:38,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:41,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:41,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:41,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:41,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:41,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:41,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:41,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:41,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:41,835 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:41,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:41,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665999300] [2023-11-29 02:10:41,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665999300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:41,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:41,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 02:10:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134752855] [2023-11-29 02:10:41,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:41,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:10:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:41,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:10:41,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:10:41,838 INFO L87 Difference]: Start difference. First operand 219 states and 314 transitions. Second operand has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 02:10:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:45,145 INFO L93 Difference]: Finished difference Result 485 states and 682 transitions. [2023-11-29 02:10:45,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:10:45,146 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 135 [2023-11-29 02:10:45,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:45,148 INFO L225 Difference]: With dead ends: 485 [2023-11-29 02:10:45,149 INFO L226 Difference]: Without dead ends: 348 [2023-11-29 02:10:45,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=175, Invalid=637, Unknown=0, NotChecked=0, Total=812 [2023-11-29 02:10:45,150 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 522 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 1160 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 1160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:45,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 696 Invalid, 1187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 1160 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-11-29 02:10:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2023-11-29 02:10:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 200. [2023-11-29 02:10:45,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 161 states have (on average 1.3229813664596273) internal successors, (213), 161 states have internal predecessors, (213), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 285 transitions. [2023-11-29 02:10:45,193 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 285 transitions. Word has length 135 [2023-11-29 02:10:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:45,193 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 285 transitions. [2023-11-29 02:10:45,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 15 states have internal predecessors, (48), 3 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2023-11-29 02:10:45,194 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 285 transitions. [2023-11-29 02:10:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 02:10:45,195 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:45,196 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:45,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:10:45,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:45,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:45,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1244922956, now seen corresponding path program 1 times [2023-11-29 02:10:45,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769772701] [2023-11-29 02:10:45,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:45,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:47,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:47,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:47,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:47,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:47,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:47,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:47,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:47,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:47,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:47,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:47,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:47,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:47,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:47,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:47,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769772701] [2023-11-29 02:10:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [769772701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:47,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-11-29 02:10:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192242120] [2023-11-29 02:10:47,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:47,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 02:10:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:47,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 02:10:47,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:10:47,503 INFO L87 Difference]: Start difference. First operand 200 states and 285 transitions. Second operand has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:50,214 INFO L93 Difference]: Finished difference Result 419 states and 591 transitions. [2023-11-29 02:10:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:10:50,214 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 136 [2023-11-29 02:10:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:50,217 INFO L225 Difference]: With dead ends: 419 [2023-11-29 02:10:50,217 INFO L226 Difference]: Without dead ends: 293 [2023-11-29 02:10:50,218 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2023-11-29 02:10:50,218 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 583 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 1504 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 584 SdHoareTripleChecker+Valid, 924 SdHoareTripleChecker+Invalid, 1552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 1504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:50,219 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [584 Valid, 924 Invalid, 1552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 1504 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 02:10:50,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2023-11-29 02:10:50,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 221. [2023-11-29 02:10:50,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 182 states have (on average 1.335164835164835) internal successors, (243), 182 states have internal predecessors, (243), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 315 transitions. [2023-11-29 02:10:50,262 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 315 transitions. Word has length 136 [2023-11-29 02:10:50,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:50,263 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 315 transitions. [2023-11-29 02:10:50,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.7222222222222223) internal successors, (49), 19 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 315 transitions. [2023-11-29 02:10:50,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 02:10:50,265 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:50,265 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:50,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:10:50,266 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:50,266 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:50,266 INFO L85 PathProgramCache]: Analyzing trace with hash 279813906, now seen corresponding path program 1 times [2023-11-29 02:10:50,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:50,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097440976] [2023-11-29 02:10:50,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:50,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:51,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:51,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:51,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:51,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:51,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:51,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:51,889 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:51,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:51,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097440976] [2023-11-29 02:10:51,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097440976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:51,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:51,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-29 02:10:51,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830086407] [2023-11-29 02:10:51,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:51,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 02:10:51,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:51,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 02:10:51,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:10:51,891 INFO L87 Difference]: Start difference. First operand 221 states and 315 transitions. Second operand has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:53,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:53,208 INFO L93 Difference]: Finished difference Result 443 states and 622 transitions. [2023-11-29 02:10:53,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:10:53,209 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 136 [2023-11-29 02:10:53,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:53,211 INFO L225 Difference]: With dead ends: 443 [2023-11-29 02:10:53,211 INFO L226 Difference]: Without dead ends: 304 [2023-11-29 02:10:53,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:10:53,212 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 688 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:53,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 378 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 725 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 02:10:53,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-11-29 02:10:53,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 244. [2023-11-29 02:10:53,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 205 states have (on average 1.3414634146341464) internal successors, (275), 205 states have internal predecessors, (275), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:53,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 347 transitions. [2023-11-29 02:10:53,267 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 347 transitions. Word has length 136 [2023-11-29 02:10:53,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:53,268 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 347 transitions. [2023-11-29 02:10:53,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.083333333333333) internal successors, (49), 13 states have internal predecessors, (49), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:10:53,268 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 347 transitions. [2023-11-29 02:10:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 02:10:53,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:53,270 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:53,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:10:53,271 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:53,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:53,271 INFO L85 PathProgramCache]: Analyzing trace with hash 534886259, now seen corresponding path program 1 times [2023-11-29 02:10:53,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:53,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879323319] [2023-11-29 02:10:53,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:53,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:53,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:53,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:53,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:53,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:53,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:53,922 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:53,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:53,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879323319] [2023-11-29 02:10:53,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879323319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:53,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:53,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:10:53,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363152243] [2023-11-29 02:10:53,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:53,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:10:53,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:53,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:10:53,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:10:53,924 INFO L87 Difference]: Start difference. First operand 244 states and 347 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:54,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:10:54,480 INFO L93 Difference]: Finished difference Result 334 states and 457 transitions. [2023-11-29 02:10:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:10:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2023-11-29 02:10:54,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:10:54,483 INFO L225 Difference]: With dead ends: 334 [2023-11-29 02:10:54,483 INFO L226 Difference]: Without dead ends: 332 [2023-11-29 02:10:54,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:10:54,484 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 201 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:10:54,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 460 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:10:54,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2023-11-29 02:10:54,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 306. [2023-11-29 02:10:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 267 states have (on average 1.307116104868914) internal successors, (349), 267 states have internal predecessors, (349), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:10:54,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 421 transitions. [2023-11-29 02:10:54,535 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 421 transitions. Word has length 136 [2023-11-29 02:10:54,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:10:54,535 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 421 transitions. [2023-11-29 02:10:54,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 9 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:10:54,535 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 421 transitions. [2023-11-29 02:10:54,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 02:10:54,537 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:10:54,537 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:10:54,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:10:54,538 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:10:54,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:10:54,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1992794654, now seen corresponding path program 1 times [2023-11-29 02:10:54,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:10:54,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302312516] [2023-11-29 02:10:54,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:10:54,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:10:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:10:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:10:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:10:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:10:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:10:57,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:10:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:10:57,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:10:57,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:10:57,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:10:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:10:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:10:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:10:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:10:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:10:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:10:57,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:10:57,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:10:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:10:57,386 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:10:57,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:10:57,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302312516] [2023-11-29 02:10:57,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302312516] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:10:57,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:10:57,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-29 02:10:57,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223759409] [2023-11-29 02:10:57,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:10:57,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:10:57,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:10:57,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:10:57,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:10:57,389 INFO L87 Difference]: Start difference. First operand 306 states and 421 transitions. Second operand has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:11:00,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:11:00,369 INFO L93 Difference]: Finished difference Result 652 states and 883 transitions. [2023-11-29 02:11:00,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:11:00,370 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 137 [2023-11-29 02:11:00,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:11:00,372 INFO L225 Difference]: With dead ends: 652 [2023-11-29 02:11:00,372 INFO L226 Difference]: Without dead ends: 444 [2023-11-29 02:11:00,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=250, Invalid=1082, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 02:11:00,374 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 499 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 1635 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1635 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:11:00,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 962 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1635 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:11:00,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2023-11-29 02:11:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 280. [2023-11-29 02:11:00,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 241 states have (on average 1.2987551867219918) internal successors, (313), 241 states have internal predecessors, (313), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:11:00,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 385 transitions. [2023-11-29 02:11:00,424 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 385 transitions. Word has length 137 [2023-11-29 02:11:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:11:00,425 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 385 transitions. [2023-11-29 02:11:00,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6315789473684212) internal successors, (50), 20 states have internal predecessors, (50), 4 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2023-11-29 02:11:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 385 transitions. [2023-11-29 02:11:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 02:11:00,426 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:11:00,427 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:11:00,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:11:00,427 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:11:00,427 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1768879630, now seen corresponding path program 1 times [2023-11-29 02:11:00,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:11:00,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675196472] [2023-11-29 02:11:00,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:00,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:11:00,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:11:01,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:11:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:11:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:11:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:11:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:11:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:11:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:11:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:11:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:11:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:11:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:11:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:11:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:11:02,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:11:02,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:11:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:11:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:11:02,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 02:11:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:11:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675196472] [2023-11-29 02:11:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675196472] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:11:02,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910513142] [2023-11-29 02:11:02,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:02,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:11:02,052 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:11:02,053 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:11:02,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:11:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:02,229 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 34 conjunts are in the unsatisfiable core [2023-11-29 02:11:02,243 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:11:03,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:11:03,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 17 [2023-11-29 02:11:03,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:11:03,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:11:03,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:11:03,785 INFO L349 Elim1Store]: treesize reduction 43, result has 25.9 percent of original size [2023-11-29 02:11:03,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 44 [2023-11-29 02:11:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2023-11-29 02:11:04,189 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:11:04,858 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 02:11:04,858 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 254 treesize of output 229 [2023-11-29 02:11:06,297 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:11:06,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910513142] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 02:11:06,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:11:06,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [18, 10] total 28 [2023-11-29 02:11:06,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298484672] [2023-11-29 02:11:06,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:11:06,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:11:06,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:11:06,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:11:06,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=665, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:11:06,300 INFO L87 Difference]: Start difference. First operand 280 states and 385 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:11:08,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:11:08,030 INFO L93 Difference]: Finished difference Result 707 states and 958 transitions. [2023-11-29 02:11:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 02:11:08,030 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 137 [2023-11-29 02:11:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:11:08,033 INFO L225 Difference]: With dead ends: 707 [2023-11-29 02:11:08,033 INFO L226 Difference]: Without dead ends: 515 [2023-11-29 02:11:08,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=276, Invalid=1704, Unknown=0, NotChecked=0, Total=1980 [2023-11-29 02:11:08,035 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 347 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:11:08,035 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 686 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 02:11:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2023-11-29 02:11:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 364. [2023-11-29 02:11:08,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 325 states have (on average 1.3107692307692307) internal successors, (426), 325 states have internal predecessors, (426), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 02:11:08,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 498 transitions. [2023-11-29 02:11:08,095 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 498 transitions. Word has length 137 [2023-11-29 02:11:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:11:08,095 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 498 transitions. [2023-11-29 02:11:08,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:11:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 498 transitions. [2023-11-29 02:11:08,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-29 02:11:08,097 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:11:08,097 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:11:08,110 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 02:11:08,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3412c319-c54e-4b68-8ba7-071a4169d6bd/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-29 02:11:08,299 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:11:08,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:08,300 INFO L85 PathProgramCache]: Analyzing trace with hash 666150117, now seen corresponding path program 1 times [2023-11-29 02:11:08,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:11:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399075971] [2023-11-29 02:11:08,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:11:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:11:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:11:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:11:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:11:12,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:11:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:11:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:11:12,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:11:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:11:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:11:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:11:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:11:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:11:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:11:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:11:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:11:12,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:11:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:11:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:11:12,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:11:12,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399075971] [2023-11-29 02:11:12,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399075971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:11:12,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:11:12,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-11-29 02:11:12,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057381675] [2023-11-29 02:11:12,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:11:12,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 02:11:12,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:11:12,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 02:11:12,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:11:12,988 INFO L87 Difference]: Start difference. First operand 364 states and 498 transitions. Second operand has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 20 states have internal predecessors, (51), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-29 02:11:19,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:11:19,918 INFO L93 Difference]: Finished difference Result 976 states and 1309 transitions. [2023-11-29 02:11:19,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-11-29 02:11:19,919 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 20 states have internal predecessors, (51), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) Word has length 138 [2023-11-29 02:11:19,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:11:19,921 INFO L225 Difference]: With dead ends: 976 [2023-11-29 02:11:19,922 INFO L226 Difference]: Without dead ends: 716 [2023-11-29 02:11:19,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=365, Invalid=1357, Unknown=0, NotChecked=0, Total=1722 [2023-11-29 02:11:19,924 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 548 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1830 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 1311 SdHoareTripleChecker+Invalid, 1881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:11:19,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 1311 Invalid, 1881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1830 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-11-29 02:11:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2023-11-29 02:11:19,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 581. [2023-11-29 02:11:19,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 523 states have (on average 1.3097514340344167) internal successors, (685), 523 states have internal predecessors, (685), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:11:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 793 transitions. [2023-11-29 02:11:19,987 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 793 transitions. Word has length 138 [2023-11-29 02:11:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:11:19,988 INFO L495 AbstractCegarLoop]: Abstraction has 581 states and 793 transitions. [2023-11-29 02:11:19,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 20 states have internal predecessors, (51), 5 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 3 states have call predecessors, (18), 5 states have call successors, (18) [2023-11-29 02:11:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 793 transitions. [2023-11-29 02:11:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2023-11-29 02:11:19,989 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:11:19,989 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:11:19,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:11:19,990 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:11:19,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:19,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1811419388, now seen corresponding path program 1 times [2023-11-29 02:11:19,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:11:19,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879541244] [2023-11-29 02:11:19,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:19,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:11:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 02:11:20,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 02:11:20,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 02:11:20,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 02:11:20,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 02:11:20,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:11:20,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 02:11:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:11:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:11:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:11:20,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:11:20,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 02:11:20,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-11-29 02:11:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-11-29 02:11:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:11:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:11:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:11:20,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-11-29 02:11:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:11:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 02:11:20,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:11:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879541244] [2023-11-29 02:11:20,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879541244] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:11:20,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:11:20,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:11:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276173205] [2023-11-29 02:11:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:11:20,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:11:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:11:20,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:11:20,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:11:20,417 INFO L87 Difference]: Start difference. First operand 581 states and 793 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:11:20,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:11:20,842 INFO L93 Difference]: Finished difference Result 1317 states and 1786 transitions. [2023-11-29 02:11:20,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:11:20,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 138 [2023-11-29 02:11:20,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:11:20,847 INFO L225 Difference]: With dead ends: 1317 [2023-11-29 02:11:20,847 INFO L226 Difference]: Without dead ends: 860 [2023-11-29 02:11:20,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:11:20,849 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 190 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:11:20,850 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 388 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:11:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2023-11-29 02:11:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 718. [2023-11-29 02:11:20,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 660 states have (on average 1.312121212121212) internal successors, (866), 660 states have internal predecessors, (866), 54 states have call successors, (54), 3 states have call predecessors, (54), 3 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 02:11:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 974 transitions. [2023-11-29 02:11:20,955 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 974 transitions. Word has length 138 [2023-11-29 02:11:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:11:20,956 INFO L495 AbstractCegarLoop]: Abstraction has 718 states and 974 transitions. [2023-11-29 02:11:20,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:11:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 974 transitions. [2023-11-29 02:11:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-11-29 02:11:20,958 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:11:20,958 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:11:20,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:11:20,958 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 02:11:20,958 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:11:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1179128960, now seen corresponding path program 1 times [2023-11-29 02:11:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:11:20,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429948991] [2023-11-29 02:11:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:11:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:11:21,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:30,363 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:13:36,386 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:13:50,097 WARN L293 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:01,734 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:14,965 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:23,049 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:31,151 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:39,245 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:14:52,420 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:01,449 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:08,508 WARN L293 SmtUtils]: Spent 5.29s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:20,538 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:25,582 WARN L293 SmtUtils]: Spent 5.04s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:30,607 WARN L293 SmtUtils]: Spent 5.02s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:38,704 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:46,791 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:15:54,884 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:02,979 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:12,045 WARN L293 SmtUtils]: Spent 5.33s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:27,808 WARN L293 SmtUtils]: Spent 7.51s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:35,920 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:44,017 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:16:52,097 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:04,372 WARN L293 SmtUtils]: Spent 8.07s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:13,974 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:29,471 WARN L293 SmtUtils]: Spent 5.42s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:34,476 WARN L293 SmtUtils]: Spent 5.00s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:42,340 WARN L293 SmtUtils]: Spent 7.32s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:51,484 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:17:58,207 WARN L293 SmtUtils]: Spent 6.72s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:04,619 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:12,702 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:22,708 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:27,849 WARN L293 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:35,931 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:44,015 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:18:56,082 WARN L293 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:07,321 WARN L293 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:13,059 WARN L293 SmtUtils]: Spent 5.72s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:23,403 WARN L293 SmtUtils]: Spent 6.26s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:40,764 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:48,862 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:19:55,462 WARN L293 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:20:03,541 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:20:09,268 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:20:33,289 WARN L293 SmtUtils]: Spent 7.15s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:20:41,381 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:20:49,470 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:21:06,147 WARN L293 SmtUtils]: Spent 7.03s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:21:25,562 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:21:33,679 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:21:41,777 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:21:52,094 WARN L293 SmtUtils]: Spent 6.12s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:03,903 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:11,996 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:20,091 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:26,499 WARN L293 SmtUtils]: Spent 6.41s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:34,596 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:46,728 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:22:54,851 WARN L293 SmtUtils]: Spent 8.11s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:02,944 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:11,028 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 39 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:30,266 WARN L293 SmtUtils]: Spent 8.10s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:38,364 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:44,696 WARN L293 SmtUtils]: Spent 6.33s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:23:59,625 WARN L293 SmtUtils]: Spent 8.09s on a formula simplification that was a NOOP. DAG size: 41 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:24:14,201 WARN L293 SmtUtils]: Spent 8.08s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-11-29 02:24:23,809 WARN L293 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 39 DAG size of output: 1 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)