./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.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_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/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_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/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_6d49682b-3505-4db1-bbd6-429743f3ec99/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 ec19acff02761ce4cb6bd833355f9203a252d8e9565b5d08ccbe5e49c9ce80f5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 00:25:53,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 00:25:53,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 00:25:53,249 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 00:25:53,249 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 00:25:53,273 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 00:25:53,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 00:25:53,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 00:25:53,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 00:25:53,275 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 00:25:53,275 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 00:25:53,276 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 00:25:53,277 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 00:25:53,277 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 00:25:53,278 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 00:25:53,278 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 00:25:53,279 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 00:25:53,279 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 00:25:53,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 00:25:53,280 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 00:25:53,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 00:25:53,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 00:25:53,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 00:25:53,282 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 00:25:53,283 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 00:25:53,283 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 00:25:53,284 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 00:25:53,284 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 00:25:53,284 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 00:25:53,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 00:25:53,285 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 00:25:53,285 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:25:53,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 00:25:53,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 00:25:53,286 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 00:25:53,286 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 00:25:53,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 00:25:53,287 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 00:25:53,287 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 00:25:53,287 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 00:25:53,287 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 00:25:53,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 00:25:53,288 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_6d49682b-3505-4db1-bbd6-429743f3ec99/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_6d49682b-3505-4db1-bbd6-429743f3ec99/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 -> ec19acff02761ce4cb6bd833355f9203a252d8e9565b5d08ccbe5e49c9ce80f5 [2023-11-29 00:25:53,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 00:25:53,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 00:25:53,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 00:25:53,506 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 00:25:53,506 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 00:25:53,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i [2023-11-29 00:25:56,259 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 00:25:56,416 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 00:25:56,417 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i [2023-11-29 00:25:56,426 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/data/88e07691e/c1b9c408ff5545f4a1797e06aba2b328/FLAG5de2b34c9 [2023-11-29 00:25:56,440 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/data/88e07691e/c1b9c408ff5545f4a1797e06aba2b328 [2023-11-29 00:25:56,443 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 00:25:56,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 00:25:56,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 00:25:56,446 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 00:25:56,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 00:25:56,452 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,453 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7461fb38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56, skipping insertion in model container [2023-11-29 00:25:56,453 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,485 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 00:25:56,631 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_6d49682b-3505-4db1-bbd6-429743f3ec99/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i[916,929] [2023-11-29 00:25:56,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:25:56,682 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 00:25:56,695 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_6d49682b-3505-4db1-bbd6-429743f3ec99/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-66.i[916,929] [2023-11-29 00:25:56,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 00:25:56,731 INFO L206 MainTranslator]: Completed translation [2023-11-29 00:25:56,732 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56 WrapperNode [2023-11-29 00:25:56,732 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 00:25:56,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 00:25:56,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 00:25:56,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 00:25:56,741 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,783 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-11-29 00:25:56,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 00:25:56,784 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 00:25:56,784 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 00:25:56,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 00:25:56,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,816 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 00:25:56,816 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,817 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,823 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,828 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 00:25:56,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 00:25:56,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 00:25:56,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 00:25:56,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (1/1) ... [2023-11-29 00:25:56,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 00:25:56,852 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:25:56,864 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 00:25:56,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 00:25:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 00:25:56,900 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 00:25:56,900 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 00:25:56,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 00:25:56,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 00:25:56,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 00:25:56,979 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 00:25:56,981 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 00:25:57,232 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 00:25:57,262 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 00:25:57,263 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 00:25:57,263 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:25:57 BoogieIcfgContainer [2023-11-29 00:25:57,263 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 00:25:57,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 00:25:57,266 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 00:25:57,269 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 00:25:57,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 12:25:56" (1/3) ... [2023-11-29 00:25:57,270 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe5a8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:25:57, skipping insertion in model container [2023-11-29 00:25:57,270 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:25:56" (2/3) ... [2023-11-29 00:25:57,271 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe5a8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 12:25:57, skipping insertion in model container [2023-11-29 00:25:57,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:25:57" (3/3) ... [2023-11-29 00:25:57,272 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-66.i [2023-11-29 00:25:57,291 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 00:25:57,291 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 00:25:57,331 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 00:25:57,337 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;@9728415, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 00:25:57,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 00:25:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 00:25:57,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:25:57,350 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:57,351 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:25:57,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:25:57,356 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:57,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1944780512, now seen corresponding path program 1 times [2023-11-29 00:25:57,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:25:57,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437615727] [2023-11-29 00:25:57,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:57,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:25:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:25:57,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:25:57,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:25:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:25:57,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:25:57,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:25:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:25:57,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:25:57,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:25:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:25:57,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:25:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:25:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:25:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:25:57,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:57,632 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:25:57,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:25:57,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437615727] [2023-11-29 00:25:57,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437615727] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:25:57,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:25:57,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 00:25:57,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166682127] [2023-11-29 00:25:57,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:25:57,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 00:25:57,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:25:57,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 00:25:57,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 00:25:57,668 INFO L87 Difference]: Start difference. First operand has 39 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 23 states have internal predecessors, (32), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:25:57,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:57,701 INFO L93 Difference]: Finished difference Result 75 states and 132 transitions. [2023-11-29 00:25:57,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 00:25:57,704 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 85 [2023-11-29 00:25:57,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:57,710 INFO L225 Difference]: With dead ends: 75 [2023-11-29 00:25:57,710 INFO L226 Difference]: Without dead ends: 37 [2023-11-29 00:25:57,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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 00:25:57,717 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:57,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:25:57,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-29 00:25:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-29 00:25:57,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-29 00:25:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 55 transitions. [2023-11-29 00:25:57,755 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 55 transitions. Word has length 85 [2023-11-29 00:25:57,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:57,755 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 55 transitions. [2023-11-29 00:25:57,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.0) internal successors, (18), 2 states have internal predecessors, (18), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:25:57,756 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 55 transitions. [2023-11-29 00:25:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 00:25:57,760 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:57,760 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:25:57,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 00:25:57,761 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:25:57,761 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:57,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1661919200, now seen corresponding path program 1 times [2023-11-29 00:25:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:25:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980330339] [2023-11-29 00:25:57,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:25:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:25:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:25:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:25:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:25:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:25:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:25:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:25:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:25:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:25:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:25:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:25:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:25:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:25:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:25:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:25:58,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:25:58,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980330339] [2023-11-29 00:25:58,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980330339] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:25:58,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:25:58,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 00:25:58,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827952672] [2023-11-29 00:25:58,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:25:58,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 00:25:58,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:25:58,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 00:25:58,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:25:58,131 INFO L87 Difference]: Start difference. First operand 37 states and 55 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:25:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:58,180 INFO L93 Difference]: Finished difference Result 109 states and 163 transitions. [2023-11-29 00:25:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 00:25:58,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 85 [2023-11-29 00:25:58,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:58,183 INFO L225 Difference]: With dead ends: 109 [2023-11-29 00:25:58,184 INFO L226 Difference]: Without dead ends: 73 [2023-11-29 00:25:58,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 00:25:58,186 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:58,187 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 00:25:58,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-29 00:25:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2023-11-29 00:25:58,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-29 00:25:58,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 104 transitions. [2023-11-29 00:25:58,211 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 104 transitions. Word has length 85 [2023-11-29 00:25:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:58,212 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 104 transitions. [2023-11-29 00:25:58,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:25:58,212 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 104 transitions. [2023-11-29 00:25:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:25:58,214 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:58,214 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:25:58,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 00:25:58,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:25:58,215 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:58,215 INFO L85 PathProgramCache]: Analyzing trace with hash -20088315, now seen corresponding path program 1 times [2023-11-29 00:25:58,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:25:58,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409860793] [2023-11-29 00:25:58,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:58,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:25:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:25:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:25:58,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:25:58,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:25:58,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:25:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:25:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:25:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:25:58,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:25:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:25:58,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:25:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:25:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:25:58,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:25:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:25:58,718 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:25:58,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:25:58,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409860793] [2023-11-29 00:25:58,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409860793] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:25:58,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:25:58,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 00:25:58,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390460293] [2023-11-29 00:25:58,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:25:58,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 00:25:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:25:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 00:25:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 00:25:58,721 INFO L87 Difference]: Start difference. First operand 70 states and 104 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:25:58,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:25:58,929 INFO L93 Difference]: Finished difference Result 183 states and 271 transitions. [2023-11-29 00:25:58,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:25:58,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2023-11-29 00:25:58,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:25:58,932 INFO L225 Difference]: With dead ends: 183 [2023-11-29 00:25:58,932 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 00:25:58,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:25:58,935 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 68 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:25:58,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 162 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:25:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 00:25:58,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 104. [2023-11-29 00:25:58,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 58 states have (on average 1.2241379310344827) internal successors, (71), 58 states have internal predecessors, (71), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:25:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2023-11-29 00:25:58,967 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 86 [2023-11-29 00:25:58,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:25:58,968 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2023-11-29 00:25:58,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:25:58,969 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2023-11-29 00:25:58,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:25:58,970 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:25:58,970 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:25:58,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 00:25:58,971 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:25:58,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:25:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash -20147897, now seen corresponding path program 1 times [2023-11-29 00:25:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:25:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283344250] [2023-11-29 00:25:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:25:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:25:59,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:03,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:03,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:03,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:03,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:03,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:03,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:03,096 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:03,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:03,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283344250] [2023-11-29 00:26:03,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283344250] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:03,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:03,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:26:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909551978] [2023-11-29 00:26:03,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:26:03,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:26:03,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:03,100 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:26:03,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:03,922 INFO L93 Difference]: Finished difference Result 110 states and 161 transitions. [2023-11-29 00:26:03,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 00:26:03,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 86 [2023-11-29 00:26:03,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:03,925 INFO L225 Difference]: With dead ends: 110 [2023-11-29 00:26:03,925 INFO L226 Difference]: Without dead ends: 108 [2023-11-29 00:26:03,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:26:03,928 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 54 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:03,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 197 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:26:03,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2023-11-29 00:26:03,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2023-11-29 00:26:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:03,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 157 transitions. [2023-11-29 00:26:03,950 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 157 transitions. Word has length 86 [2023-11-29 00:26:03,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:03,950 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 157 transitions. [2023-11-29 00:26:03,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-29 00:26:03,951 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 157 transitions. [2023-11-29 00:26:03,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:26:03,952 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:03,953 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:26:03,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 00:26:03,953 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:03,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:03,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1204557765, now seen corresponding path program 1 times [2023-11-29 00:26:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368517407] [2023-11-29 00:26:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:08,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:08,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:08,978 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:08,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:08,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368517407] [2023-11-29 00:26:08,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368517407] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:08,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:08,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:26:08,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906696954] [2023-11-29 00:26:08,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:08,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:26:08,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:08,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:26:08,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:26:08,982 INFO L87 Difference]: Start difference. First operand 106 states and 157 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:10,483 INFO L93 Difference]: Finished difference Result 146 states and 208 transitions. [2023-11-29 00:26:10,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:26:10,483 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-29 00:26:10,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:10,485 INFO L225 Difference]: With dead ends: 146 [2023-11-29 00:26:10,485 INFO L226 Difference]: Without dead ends: 144 [2023-11-29 00:26:10,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-29 00:26:10,487 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 110 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:10,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 231 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:26:10,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2023-11-29 00:26:10,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 113. [2023-11-29 00:26:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 67 states have internal predecessors, (85), 42 states have call successors, (42), 3 states have call predecessors, (42), 3 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 169 transitions. [2023-11-29 00:26:10,513 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 169 transitions. Word has length 86 [2023-11-29 00:26:10,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:10,514 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 169 transitions. [2023-11-29 00:26:10,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:10,514 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 169 transitions. [2023-11-29 00:26:10,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:26:10,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:10,516 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:26:10,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 00:26:10,517 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:10,517 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:10,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1206404807, now seen corresponding path program 1 times [2023-11-29 00:26:10,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:10,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146499936] [2023-11-29 00:26:10,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:10,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:10,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:10,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:10,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:10,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:10,661 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:10,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:10,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146499936] [2023-11-29 00:26:10,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146499936] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:10,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:10,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 00:26:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043976247] [2023-11-29 00:26:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:10,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 00:26:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 00:26:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 00:26:10,665 INFO L87 Difference]: Start difference. First operand 113 states and 169 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:10,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:10,797 INFO L93 Difference]: Finished difference Result 186 states and 266 transitions. [2023-11-29 00:26:10,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 00:26:10,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-29 00:26:10,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:10,800 INFO L225 Difference]: With dead ends: 186 [2023-11-29 00:26:10,800 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 00:26:10,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 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 00:26:10,802 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 61 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:10,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 140 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 00:26:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 00:26:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 126. [2023-11-29 00:26:10,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 77 states have (on average 1.2077922077922079) internal successors, (93), 77 states have internal predecessors, (93), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:10,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 177 transitions. [2023-11-29 00:26:10,827 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 177 transitions. Word has length 86 [2023-11-29 00:26:10,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:10,827 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 177 transitions. [2023-11-29 00:26:10,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:10,828 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 177 transitions. [2023-11-29 00:26:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:26:10,829 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:10,829 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:26:10,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 00:26:10,830 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:10,830 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:10,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1261816067, now seen corresponding path program 1 times [2023-11-29 00:26:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108089599] [2023-11-29 00:26:10,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:10,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:21,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:21,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:21,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:21,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:21,453 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:21,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:21,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108089599] [2023-11-29 00:26:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108089599] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 00:26:21,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14160159] [2023-11-29 00:26:21,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:21,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 00:26:21,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:21,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 00:26:21,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 00:26:21,455 INFO L87 Difference]: Start difference. First operand 126 states and 177 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:22,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:22,473 INFO L93 Difference]: Finished difference Result 165 states and 221 transitions. [2023-11-29 00:26:22,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 00:26:22,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-29 00:26:22,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:22,475 INFO L225 Difference]: With dead ends: 165 [2023-11-29 00:26:22,475 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 00:26:22,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-11-29 00:26:22,477 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 93 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:22,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 226 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:26:22,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 00:26:22,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 131. [2023-11-29 00:26:22,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.2098765432098766) internal successors, (98), 81 states have internal predecessors, (98), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 182 transitions. [2023-11-29 00:26:22,500 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 182 transitions. Word has length 86 [2023-11-29 00:26:22,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:22,501 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 182 transitions. [2023-11-29 00:26:22,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 182 transitions. [2023-11-29 00:26:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-11-29 00:26:22,502 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:22,502 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:26:22,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 00:26:22,503 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:22,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:22,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1263663109, now seen corresponding path program 1 times [2023-11-29 00:26:22,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:22,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423409527] [2023-11-29 00:26:22,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:22,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:24,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:24,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:24,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:24,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:24,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:24,611 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:24,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:24,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423409527] [2023-11-29 00:26:24,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423409527] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:24,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:24,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:26:24,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747116723] [2023-11-29 00:26:24,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:24,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:26:24,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:24,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:26:24,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:24,613 INFO L87 Difference]: Start difference. First operand 131 states and 182 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:25,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:25,397 INFO L93 Difference]: Finished difference Result 206 states and 280 transitions. [2023-11-29 00:26:25,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 00:26:25,398 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 86 [2023-11-29 00:26:25,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:25,399 INFO L225 Difference]: With dead ends: 206 [2023-11-29 00:26:25,400 INFO L226 Difference]: Without dead ends: 165 [2023-11-29 00:26:25,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-11-29 00:26:25,401 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 75 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:25,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 259 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:26:25,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-29 00:26:25,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 129. [2023-11-29 00:26:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2023-11-29 00:26:25,438 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 86 [2023-11-29 00:26:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:25,439 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2023-11-29 00:26:25,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2023-11-29 00:26:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 00:26:25,440 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:25,441 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:26:25,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 00:26:25,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:25,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:25,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1313450494, now seen corresponding path program 1 times [2023-11-29 00:26:25,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:25,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979823560] [2023-11-29 00:26:25,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:25,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:28,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:28,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:28,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:28,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:28,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:28,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:28,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:28,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:28,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:28,553 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:28,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:28,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979823560] [2023-11-29 00:26:28,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979823560] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:28,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:28,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 00:26:28,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597269572] [2023-11-29 00:26:28,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:28,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 00:26:28,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:28,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 00:26:28,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 00:26:28,555 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:29,700 INFO L93 Difference]: Finished difference Result 154 states and 206 transitions. [2023-11-29 00:26:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 00:26:29,700 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-11-29 00:26:29,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:29,701 INFO L225 Difference]: With dead ends: 154 [2023-11-29 00:26:29,701 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 00:26:29,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2023-11-29 00:26:29,702 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 73 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:29,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 229 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 00:26:29,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 00:26:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 131. [2023-11-29 00:26:29,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 81 states have internal predecessors, (97), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2023-11-29 00:26:29,719 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 87 [2023-11-29 00:26:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:29,719 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2023-11-29 00:26:29,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2023-11-29 00:26:29,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-29 00:26:29,720 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:29,720 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:26:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 00:26:29,720 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:29,721 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 461556868, now seen corresponding path program 1 times [2023-11-29 00:26:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:29,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748862791] [2023-11-29 00:26:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:29,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:33,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:33,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:33,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:33,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:33,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:33,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:33,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:33,894 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-29 00:26:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:33,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748862791] [2023-11-29 00:26:33,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748862791] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 00:26:33,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 00:26:33,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 00:26:33,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125444951] [2023-11-29 00:26:33,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 00:26:33,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 00:26:33,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:33,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 00:26:33,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-29 00:26:33,896 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:35,488 INFO L93 Difference]: Finished difference Result 150 states and 200 transitions. [2023-11-29 00:26:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 00:26:35,489 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 87 [2023-11-29 00:26:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:35,490 INFO L225 Difference]: With dead ends: 150 [2023-11-29 00:26:35,490 INFO L226 Difference]: Without dead ends: 148 [2023-11-29 00:26:35,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2023-11-29 00:26:35,491 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 77 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:35,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 228 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 00:26:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2023-11-29 00:26:35,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 129. [2023-11-29 00:26:35,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 79 states have internal predecessors, (94), 42 states have call successors, (42), 7 states have call predecessors, (42), 7 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:35,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 178 transitions. [2023-11-29 00:26:35,519 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 178 transitions. Word has length 87 [2023-11-29 00:26:35,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:35,519 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 178 transitions. [2023-11-29 00:26:35,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 11 states have internal predecessors, (20), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-11-29 00:26:35,520 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2023-11-29 00:26:35,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 00:26:35,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:35,522 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:35,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 00:26:35,522 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:35,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:35,523 INFO L85 PathProgramCache]: Analyzing trace with hash 324235561, now seen corresponding path program 1 times [2023-11-29 00:26:35,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:35,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679614455] [2023-11-29 00:26:35,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:35,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:40,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:40,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:40,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:40,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:40,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:26:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:40,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 00:26:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:26:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 00:26:40,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:26:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:26:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:26:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 00:26:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 00:26:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:26:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:26:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:26:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:40,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:26:40,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679614455] [2023-11-29 00:26:40,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679614455] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:40,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909416468] [2023-11-29 00:26:40,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:40,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:40,940 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:40,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 00:26:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:41,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 00:26:41,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 00:26:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 914 proven. 33 refuted. 0 times theorem prover too weak. 592 trivial. 0 not checked. [2023-11-29 00:26:41,243 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 00:26:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1539 backedges. 31 proven. 75 refuted. 0 times theorem prover too weak. 1433 trivial. 0 not checked. [2023-11-29 00:26:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909416468] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 00:26:41,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 00:26:41,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5, 5] total 21 [2023-11-29 00:26:41,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126539695] [2023-11-29 00:26:41,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 00:26:41,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 00:26:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 00:26:41,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 00:26:41,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2023-11-29 00:26:41,478 INFO L87 Difference]: Start difference. First operand 129 states and 178 transitions. Second operand has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2023-11-29 00:26:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 00:26:47,633 INFO L93 Difference]: Finished difference Result 288 states and 378 transitions. [2023-11-29 00:26:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2023-11-29 00:26:47,634 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) Word has length 170 [2023-11-29 00:26:47,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 00:26:47,636 INFO L225 Difference]: With dead ends: 288 [2023-11-29 00:26:47,636 INFO L226 Difference]: Without dead ends: 245 [2023-11-29 00:26:47,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1611 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=825, Invalid=4577, Unknown=0, NotChecked=0, Total=5402 [2023-11-29 00:26:47,639 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 395 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-29 00:26:47,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 363 Invalid, 1131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-29 00:26:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-11-29 00:26:47,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 144. [2023-11-29 00:26:47,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.1444444444444444) internal successors, (103), 90 states have internal predecessors, (103), 42 states have call successors, (42), 11 states have call predecessors, (42), 11 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 00:26:47,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 187 transitions. [2023-11-29 00:26:47,665 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 187 transitions. Word has length 170 [2023-11-29 00:26:47,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 00:26:47,666 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 187 transitions. [2023-11-29 00:26:47,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.9047619047619047) internal successors, (82), 21 states have internal predecessors, (82), 5 states have call successors, (78), 3 states have call predecessors, (78), 5 states have return successors, (80), 5 states have call predecessors, (80), 5 states have call successors, (80) [2023-11-29 00:26:47,666 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 187 transitions. [2023-11-29 00:26:47,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2023-11-29 00:26:47,668 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 00:26:47,669 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 28, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 00:26:47,675 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-29 00:26:47,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-29 00:26:47,869 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 00:26:47,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 00:26:47,870 INFO L85 PathProgramCache]: Analyzing trace with hash -774169141, now seen corresponding path program 1 times [2023-11-29 00:26:47,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 00:26:47,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480354741] [2023-11-29 00:26:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:47,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 00:26:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 00:26:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 00:26:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 00:26:51,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 00:26:51,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 00:26:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 00:26:51,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 00:26:51,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 00:26:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 00:26:51,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 00:26:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 00:26:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 00:26:51,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 00:26:51,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 00:26:51,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-29 00:26:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 00:26:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 00:26:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 00:26:51,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2023-11-29 00:26:51,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2023-11-29 00:26:51,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 00:26:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 00:26:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 00:26:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2023-11-29 00:26:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 00:26:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2023-11-29 00:26:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2023-11-29 00:26:51,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 00:26:51,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2023-11-29 00:26:51,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 00:26:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480354741] [2023-11-29 00:26:51,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480354741] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 00:26:51,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1768052050] [2023-11-29 00:26:51,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 00:26:51,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 00:26:51,141 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 00:26:51,142 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 00:26:51,155 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d49682b-3505-4db1-bbd6-429743f3ec99/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 00:26:51,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 00:26:51,259 INFO L262 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 67 conjunts are in the unsatisfiable core [2023-11-29 00:26:51,270 INFO L285 TraceCheckSpWp]: Computing forward predicates...