./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-25.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU --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 1092dc43771f76171dbbfe5cf9949987a7ce05735adacf2ba24acd31005dd17a --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:09:05,907 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:09:06,000 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:09:06,009 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:09:06,009 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:09:06,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:09:06,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:09:06,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:09:06,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:09:06,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:09:06,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:09:06,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:09:06,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:09:06,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:09:06,046 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:09:06,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:09:06,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:09:06,048 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:09:06,048 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:09:06,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:09:06,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:09:06,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:09:06,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:09:06,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:09:06,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:09:06,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:09:06,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:09:06,052 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:09:06,052 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:09:06,052 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:09:06,053 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:09:06,053 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:09:06,054 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:06,054 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:09:06,054 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:09:06,055 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:09:06,055 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:09:06,055 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:09:06,056 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:09:06,056 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:09:06,056 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:09:06,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:09:06,057 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_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/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_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 1092dc43771f76171dbbfe5cf9949987a7ce05735adacf2ba24acd31005dd17a [2024-10-31 22:09:06,372 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:09:06,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:09:06,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:09:06,408 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:09:06,409 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:09:06,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-25.i Unable to find full path for "g++" [2024-10-31 22:09:08,654 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:09:08,996 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:09:09,001 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-25.i [2024-10-31 22:09:09,021 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/data/b960bbd0e/deec9addef6848aca37d31cbee268806/FLAG165401436 [2024-10-31 22:09:09,063 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/data/b960bbd0e/deec9addef6848aca37d31cbee268806 [2024-10-31 22:09:09,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:09:09,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:09:09,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:09,079 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:09:09,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:09:09,094 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,095 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e45209 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09, skipping insertion in model container [2024-10-31 22:09:09,095 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,144 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:09:09,357 WARN L251 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_d9f91d1e-bf28-476b-84a2-98c0b8500a75/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-25.i[915,928] [2024-10-31 22:09:09,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:09,420 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:09:09,432 WARN L251 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_d9f91d1e-bf28-476b-84a2-98c0b8500a75/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-25.i[915,928] [2024-10-31 22:09:09,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:09:09,482 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:09:09,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09 WrapperNode [2024-10-31 22:09:09,482 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:09:09,484 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:09,484 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:09:09,484 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:09:09,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,504 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,539 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 125 [2024-10-31 22:09:09,542 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:09:09,543 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:09:09,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:09:09,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:09:09,566 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,567 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,571 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,595 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-31 22:09:09,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,606 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,607 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,610 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:09:09,611 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:09:09,611 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:09:09,611 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:09:09,612 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (1/1) ... [2024-10-31 22:09:09,619 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:09:09,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:09:09,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:09:09,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d9f91d1e-bf28-476b-84a2-98c0b8500a75/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:09:09,692 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:09:09,693 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:09:09,694 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:09:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:09:09,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:09:09,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:09:09,784 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:09:09,787 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:09:10,160 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-31 22:09:10,160 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:09:10,183 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:09:10,184 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:09:10,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:10 BoogieIcfgContainer [2024-10-31 22:09:10,184 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:09:10,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:09:10,189 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:09:10,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:09:10,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:09:09" (1/3) ... [2024-10-31 22:09:10,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb82ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:10, skipping insertion in model container [2024-10-31 22:09:10,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:09:09" (2/3) ... [2024-10-31 22:09:10,195 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1cb82ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:09:10, skipping insertion in model container [2024-10-31 22:09:10,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:09:10" (3/3) ... [2024-10-31 22:09:10,197 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-25.i [2024-10-31 22:09:10,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:09:10,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:09:10,314 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:09:10,324 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@70adba4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:09:10,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:09:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand has 58 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 22:09:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-31 22:09:10,352 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:10,353 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:10,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:10,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:10,360 INFO L85 PathProgramCache]: Analyzing trace with hash 541245253, now seen corresponding path program 1 times [2024-10-31 22:09:10,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:10,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571149983] [2024-10-31 22:09:10,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:10,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:10,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:10,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:10,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:10,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:10,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:10,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:10,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:10,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:10,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:10,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:10,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:10,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:10,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 22:09:10,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:10,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571149983] [2024-10-31 22:09:10,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571149983] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:10,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:10,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:09:10,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863446003] [2024-10-31 22:09:10,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:10,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:09:10,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:10,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:09:10,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:10,877 INFO L87 Difference]: Start difference. First operand has 58 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 22:09:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:10,905 INFO L93 Difference]: Finished difference Result 109 states and 191 transitions. [2024-10-31 22:09:10,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:09:10,910 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 139 [2024-10-31 22:09:10,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:10,920 INFO L225 Difference]: With dead ends: 109 [2024-10-31 22:09:10,920 INFO L226 Difference]: Without dead ends: 54 [2024-10-31 22:09:10,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:09:10,927 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:10,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:09:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-31 22:09:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-31 22:09:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-31 22:09:10,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 80 transitions. [2024-10-31 22:09:10,973 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 80 transitions. Word has length 139 [2024-10-31 22:09:10,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:10,973 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 80 transitions. [2024-10-31 22:09:10,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-31 22:09:10,974 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 80 transitions. [2024-10-31 22:09:10,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-31 22:09:10,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:10,977 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:10,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:09:10,978 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:10,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:10,979 INFO L85 PathProgramCache]: Analyzing trace with hash -2026429689, now seen corresponding path program 1 times [2024-10-31 22:09:10,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:10,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456685555] [2024-10-31 22:09:10,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:10,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:14,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:14,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:14,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 22:09:14,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:14,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456685555] [2024-10-31 22:09:14,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456685555] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:14,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:14,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:09:14,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356052708] [2024-10-31 22:09:14,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:14,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:09:14,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:09:14,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:09:14,257 INFO L87 Difference]: Start difference. First operand 54 states and 80 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:15,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:15,596 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-31 22:09:15,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:09:15,598 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2024-10-31 22:09:15,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:15,600 INFO L225 Difference]: With dead ends: 90 [2024-10-31 22:09:15,600 INFO L226 Difference]: Without dead ends: 88 [2024-10-31 22:09:15,601 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:09:15,602 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 40 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:15,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 442 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-31 22:09:15,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-31 22:09:15,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 72. [2024-10-31 22:09:15,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 43 states have internal predecessors, (49), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:09:15,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 103 transitions. [2024-10-31 22:09:15,642 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 103 transitions. Word has length 139 [2024-10-31 22:09:15,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:15,643 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 103 transitions. [2024-10-31 22:09:15,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 103 transitions. [2024-10-31 22:09:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-31 22:09:15,648 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:15,648 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:09:15,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:15,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:15,651 INFO L85 PathProgramCache]: Analyzing trace with hash -2024582647, now seen corresponding path program 1 times [2024-10-31 22:09:15,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:15,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385567809] [2024-10-31 22:09:15,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:15,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:20,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:20,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:20,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 22:09:20,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:20,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385567809] [2024-10-31 22:09:20,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385567809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:20,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:20,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:09:20,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515157412] [2024-10-31 22:09:20,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:20,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:09:20,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:20,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:09:20,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:09:20,905 INFO L87 Difference]: Start difference. First operand 72 states and 103 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:21,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:21,740 INFO L93 Difference]: Finished difference Result 87 states and 119 transitions. [2024-10-31 22:09:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:09:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2024-10-31 22:09:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:21,744 INFO L225 Difference]: With dead ends: 87 [2024-10-31 22:09:21,744 INFO L226 Difference]: Without dead ends: 85 [2024-10-31 22:09:21,745 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:09:21,746 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 23 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:21,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 368 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:09:21,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-31 22:09:21,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 75. [2024-10-31 22:09:21,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:09:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2024-10-31 22:09:21,793 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 139 [2024-10-31 22:09:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:21,795 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2024-10-31 22:09:21,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:21,797 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2024-10-31 22:09:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-31 22:09:21,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:21,800 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:21,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:09:21,800 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:21,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:21,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1969171387, now seen corresponding path program 1 times [2024-10-31 22:09:21,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:21,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673323545] [2024-10-31 22:09:21,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:21,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:24,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:24,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:24,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:24,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:24,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:24,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:24,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 22:09:24,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:24,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673323545] [2024-10-31 22:09:24,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673323545] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:24,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:24,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:09:24,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895037223] [2024-10-31 22:09:24,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:24,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:09:24,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:24,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:09:24,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:09:24,235 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:24,885 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2024-10-31 22:09:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:09:24,887 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2024-10-31 22:09:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:24,888 INFO L225 Difference]: With dead ends: 103 [2024-10-31 22:09:24,889 INFO L226 Difference]: Without dead ends: 101 [2024-10-31 22:09:24,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:09:24,894 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 40 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:24,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 400 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:09:24,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-31 22:09:24,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2024-10-31 22:09:24,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 46 states have (on average 1.173913043478261) internal successors, (54), 47 states have internal predecessors, (54), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:09:24,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 108 transitions. [2024-10-31 22:09:24,917 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 108 transitions. Word has length 139 [2024-10-31 22:09:24,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:24,918 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 108 transitions. [2024-10-31 22:09:24,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:24,918 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 108 transitions. [2024-10-31 22:09:24,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-10-31 22:09:24,920 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:24,921 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:24,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:09:24,921 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:24,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1967324345, now seen corresponding path program 1 times [2024-10-31 22:09:24,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:24,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434033148] [2024-10-31 22:09:24,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:24,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:27,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:27,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:27,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:27,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:27,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:27,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:27,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:27,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:27,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:27,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:27,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:27,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 22:09:27,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:27,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434033148] [2024-10-31 22:09:27,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434033148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:27,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:27,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:09:27,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716863030] [2024-10-31 22:09:27,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:27,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:09:27,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:27,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:09:27,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:09:27,259 INFO L87 Difference]: Start difference. First operand 76 states and 108 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:29,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:29,044 INFO L93 Difference]: Finished difference Result 90 states and 122 transitions. [2024-10-31 22:09:29,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:09:29,045 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 139 [2024-10-31 22:09:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:29,046 INFO L225 Difference]: With dead ends: 90 [2024-10-31 22:09:29,046 INFO L226 Difference]: Without dead ends: 88 [2024-10-31 22:09:29,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:09:29,048 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 18 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:29,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 478 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:09:29,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-31 22:09:29,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 75. [2024-10-31 22:09:29,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 46 states have internal predecessors, (52), 27 states have call successors, (27), 2 states have call predecessors, (27), 2 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-31 22:09:29,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 106 transitions. [2024-10-31 22:09:29,082 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 106 transitions. Word has length 139 [2024-10-31 22:09:29,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:29,082 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 106 transitions. [2024-10-31 22:09:29,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:29,083 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 106 transitions. [2024-10-31 22:09:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-10-31 22:09:29,085 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:29,085 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:29,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:09:29,086 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:29,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1027109963, now seen corresponding path program 1 times [2024-10-31 22:09:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:29,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83424310] [2024-10-31 22:09:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:29,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:29,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:29,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:29,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:29,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:29,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:29,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:29,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:29,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:29,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:29,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:29,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-31 22:09:29,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:29,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83424310] [2024-10-31 22:09:29,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83424310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:29,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:29,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:09:29,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268094794] [2024-10-31 22:09:29,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:29,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:09:29,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:29,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:09:29,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:09:29,388 INFO L87 Difference]: Start difference. First operand 75 states and 106 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:29,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:29,574 INFO L93 Difference]: Finished difference Result 208 states and 295 transitions. [2024-10-31 22:09:29,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:09:29,575 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 140 [2024-10-31 22:09:29,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:29,577 INFO L225 Difference]: With dead ends: 208 [2024-10-31 22:09:29,577 INFO L226 Difference]: Without dead ends: 136 [2024-10-31 22:09:29,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:09:29,580 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 50 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:29,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 223 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:09:29,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-10-31 22:09:29,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 120. [2024-10-31 22:09:29,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 66 states have (on average 1.121212121212121) internal successors, (74), 67 states have internal predecessors, (74), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-31 22:09:29,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 174 transitions. [2024-10-31 22:09:29,627 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 174 transitions. Word has length 140 [2024-10-31 22:09:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:29,627 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 174 transitions. [2024-10-31 22:09:29,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 174 transitions. [2024-10-31 22:09:29,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-31 22:09:29,635 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:29,635 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:09:29,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:09:29,635 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:29,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash -180625310, now seen corresponding path program 1 times [2024-10-31 22:09:29,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:29,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453711019] [2024-10-31 22:09:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:29,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:29,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:09:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:09:34,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:09:34,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:09:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:09:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:09:34,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:09:34,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:09:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:09:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:09:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:09:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:09:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:09:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:09:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-31 22:09:34,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-31 22:09:34,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-31 22:09:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-31 22:09:34,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-31 22:09:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-31 22:09:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-31 22:09:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-31 22:09:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-31 22:09:34,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-10-31 22:09:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-10-31 22:09:34,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-10-31 22:09:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-10-31 22:09:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2024-10-31 22:09:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2024-10-31 22:09:34,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2024-10-31 22:09:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2024-10-31 22:09:34,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-31 22:09:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2024-10-31 22:09:34,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2024-10-31 22:09:34,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2024-10-31 22:09:34,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2024-10-31 22:09:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-31 22:09:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2024-10-31 22:09:34,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2024-10-31 22:09:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2024-10-31 22:09:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2024-10-31 22:09:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-31 22:09:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2024-10-31 22:09:34,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2024-10-31 22:09:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 256 [2024-10-31 22:09:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2024-10-31 22:09:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:09:34,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4183 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4177 trivial. 0 not checked. [2024-10-31 22:09:34,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:09:34,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453711019] [2024-10-31 22:09:34,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453711019] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:09:34,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:09:34,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:09:34,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352932386] [2024-10-31 22:09:34,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:09:34,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:09:34,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:09:34,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:09:34,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:09:34,573 INFO L87 Difference]: Start difference. First operand 120 states and 174 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:37,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:09:37,615 INFO L93 Difference]: Finished difference Result 164 states and 223 transitions. [2024-10-31 22:09:37,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-31 22:09:37,616 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 276 [2024-10-31 22:09:37,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:09:37,618 INFO L225 Difference]: With dead ends: 164 [2024-10-31 22:09:37,618 INFO L226 Difference]: Without dead ends: 162 [2024-10-31 22:09:37,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:09:37,621 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 71 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:09:37,622 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 423 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:09:37,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-31 22:09:37,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 126. [2024-10-31 22:09:37,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.1388888888888888) internal successors, (82), 73 states have internal predecessors, (82), 50 states have call successors, (50), 3 states have call predecessors, (50), 3 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-31 22:09:37,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-10-31 22:09:37,663 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 276 [2024-10-31 22:09:37,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:09:37,664 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-10-31 22:09:37,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-31 22:09:37,665 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-10-31 22:09:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2024-10-31 22:09:37,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:09:37,673 INFO L215 NwaCegarLoop]: trace histogram [46, 46, 46, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-10-31 22:09:37,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:09:37,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:09:37,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:09:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash -178778268, now seen corresponding path program 1 times [2024-10-31 22:09:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:09:37,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259175028] [2024-10-31 22:09:37,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:09:37,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:09:37,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat