./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6f520cae1fe274b0f3a6786f3c06c3b2db48180a97ced5103b1a188b50ee581d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 20:51:33,039 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 20:51:33,041 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 20:51:33,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 20:51:33,078 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 20:51:33,079 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 20:51:33,080 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 20:51:33,082 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 20:51:33,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 20:51:33,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 20:51:33,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 20:51:33,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 20:51:33,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 20:51:33,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 20:51:33,089 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 20:51:33,090 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 20:51:33,091 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 20:51:33,092 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 20:51:33,093 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 20:51:33,095 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 20:51:33,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 20:51:33,108 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 20:51:33,109 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 20:51:33,110 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 20:51:33,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 20:51:33,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 20:51:33,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 20:51:33,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 20:51:33,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 20:51:33,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 20:51:33,116 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 20:51:33,117 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 20:51:33,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 20:51:33,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 20:51:33,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 20:51:33,124 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 20:51:33,125 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 20:51:33,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 20:51:33,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 20:51:33,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 20:51:33,128 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 20:51:33,130 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-02 20:51:33,173 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 20:51:33,174 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 20:51:33,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 20:51:33,175 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 20:51:33,176 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 20:51:33,176 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 20:51:33,177 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 20:51:33,177 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 20:51:33,177 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 20:51:33,178 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 20:51:33,179 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-02 20:51:33,179 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 20:51:33,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-02 20:51:33,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 20:51:33,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 20:51:33,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 20:51:33,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 20:51:33,187 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-02 20:51:33,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 20:51:33,187 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 20:51:33,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 20:51:33,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 20:51:33,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 20:51:33,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 20:51:33,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:33,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 20:51:33,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 20:51:33,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 20:51:33,191 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 20:51:33,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 20:51:33,191 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 20:51:33,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 20:51:33,192 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 20:51:33,192 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/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_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6f520cae1fe274b0f3a6786f3c06c3b2db48180a97ced5103b1a188b50ee581d [2022-11-02 20:51:33,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 20:51:33,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 20:51:33,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 20:51:33,503 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 20:51:33,504 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 20:51:33,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c [2022-11-02 20:51:33,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/data/d6afb6ee3/2619ca56f97b4115a431d4b2544521c4/FLAGc80f4f56b [2022-11-02 20:51:34,100 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 20:51:34,100 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c [2022-11-02 20:51:34,122 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/data/d6afb6ee3/2619ca56f97b4115a431d4b2544521c4/FLAGc80f4f56b [2022-11-02 20:51:34,389 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/data/d6afb6ee3/2619ca56f97b4115a431d4b2544521c4 [2022-11-02 20:51:34,391 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 20:51:34,392 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 20:51:34,410 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:34,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 20:51:34,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 20:51:34,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:34,418 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a242768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34, skipping insertion in model container [2022-11-02 20:51:34,418 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:34,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 20:51:34,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 20:51:34,661 WARN L230 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_94e84507-a2bd-4089-b95a-153fe17cb0ae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c[911,924] [2022-11-02 20:51:34,735 WARN L230 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_94e84507-a2bd-4089-b95a-153fe17cb0ae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c[8416,8429] [2022-11-02 20:51:34,845 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:34,856 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 20:51:34,873 WARN L230 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_94e84507-a2bd-4089-b95a-153fe17cb0ae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c[911,924] [2022-11-02 20:51:34,893 WARN L230 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_94e84507-a2bd-4089-b95a-153fe17cb0ae/sv-benchmarks/c/combinations/pc_sfifo_3.cil+token_ring.13.cil-2.c[8416,8429] [2022-11-02 20:51:34,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 20:51:34,991 INFO L208 MainTranslator]: Completed translation [2022-11-02 20:51:34,992 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34 WrapperNode [2022-11-02 20:51:34,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 20:51:34,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:34,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 20:51:34,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 20:51:35,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,071 INFO L138 Inliner]: procedures = 81, calls = 100, calls flagged for inlining = 50, calls inlined = 50, statements flattened = 1136 [2022-11-02 20:51:35,071 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 20:51:35,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 20:51:35,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 20:51:35,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 20:51:35,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,126 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,129 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,136 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 20:51:35,137 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 20:51:35,137 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 20:51:35,137 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 20:51:35,148 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (1/1) ... [2022-11-02 20:51:35,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 20:51:35,174 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:35,186 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 20:51:35,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 20:51:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 20:51:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-02 20:51:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-02 20:51:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2022-11-02 20:51:35,229 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2022-11-02 20:51:35,229 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-02 20:51:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-02 20:51:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-02 20:51:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-02 20:51:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2022-11-02 20:51:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2022-11-02 20:51:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-02 20:51:35,230 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-02 20:51:35,230 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-02 20:51:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-02 20:51:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2022-11-02 20:51:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2022-11-02 20:51:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2022-11-02 20:51:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2022-11-02 20:51:35,231 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2022-11-02 20:51:35,231 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2022-11-02 20:51:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-02 20:51:35,232 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-02 20:51:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 20:51:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-02 20:51:35,232 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-02 20:51:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2022-11-02 20:51:35,232 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2022-11-02 20:51:35,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 20:51:35,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 20:51:35,233 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-02 20:51:35,233 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-02 20:51:35,431 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 20:51:35,433 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 20:51:36,481 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##56: assume !(1 == ~q_free~0); [2022-11-02 20:51:36,481 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume 1 == ~q_free~0;~c_dr_st~0 := 2;~c_dr_pc~0 := 2;~a_t~0 := do_read_c_~a~0#1; [2022-11-02 20:51:36,572 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 20:51:36,590 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 20:51:36,591 INFO L300 CfgBuilder]: Removed 20 assume(true) statements. [2022-11-02 20:51:36,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:36 BoogieIcfgContainer [2022-11-02 20:51:36,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 20:51:36,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 20:51:36,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 20:51:36,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 20:51:36,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 08:51:34" (1/3) ... [2022-11-02 20:51:36,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77980d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:36, skipping insertion in model container [2022-11-02 20:51:36,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 08:51:34" (2/3) ... [2022-11-02 20:51:36,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77980d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 08:51:36, skipping insertion in model container [2022-11-02 20:51:36,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 08:51:36" (3/3) ... [2022-11-02 20:51:36,605 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_3.cil+token_ring.13.cil-2.c [2022-11-02 20:51:36,624 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 20:51:36,625 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-02 20:51:36,729 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 20:51:36,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@244103a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 20:51:36,736 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-02 20:51:36,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 524 states, 464 states have (on average 1.6422413793103448) internal successors, (762), 470 states have internal predecessors, (762), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-02 20:51:36,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:51:36,755 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:36,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:36,756 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:36,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:36,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1273219449, now seen corresponding path program 1 times [2022-11-02 20:51:36,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:36,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027511308] [2022-11-02 20:51:36,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:37,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:51:37,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:37,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:37,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027511308] [2022-11-02 20:51:37,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027511308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:37,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:37,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:51:37,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458478994] [2022-11-02 20:51:37,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:37,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:37,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:37,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:37,513 INFO L87 Difference]: Start difference. First operand has 524 states, 464 states have (on average 1.6422413793103448) internal successors, (762), 470 states have internal predecessors, (762), 43 states have call successors, (43), 14 states have call predecessors, (43), 14 states have return successors, (43), 42 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:51:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:39,207 INFO L93 Difference]: Finished difference Result 1170 states and 1881 transitions. [2022-11-02 20:51:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:51:39,210 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 65 [2022-11-02 20:51:39,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:39,240 INFO L225 Difference]: With dead ends: 1170 [2022-11-02 20:51:39,240 INFO L226 Difference]: Without dead ends: 665 [2022-11-02 20:51:39,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:51:39,255 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 1335 mSDsluCounter, 1973 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1342 SdHoareTripleChecker+Valid, 2808 SdHoareTripleChecker+Invalid, 1390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:39,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1342 Valid, 2808 Invalid, 1390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1186 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:51:39,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-02 20:51:39,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 626. [2022-11-02 20:51:39,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 546 states have (on average 1.532967032967033) internal successors, (837), 552 states have internal predecessors, (837), 56 states have call successors, (56), 21 states have call predecessors, (56), 22 states have return successors, (59), 55 states have call predecessors, (59), 54 states have call successors, (59) [2022-11-02 20:51:39,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 952 transitions. [2022-11-02 20:51:39,376 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 952 transitions. Word has length 65 [2022-11-02 20:51:39,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:39,377 INFO L495 AbstractCegarLoop]: Abstraction has 626 states and 952 transitions. [2022-11-02 20:51:39,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 5 states have internal predecessors, (50), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:51:39,377 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 952 transitions. [2022-11-02 20:51:39,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-02 20:51:39,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:39,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:39,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 20:51:39,382 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:39,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:39,383 INFO L85 PathProgramCache]: Analyzing trace with hash 265120581, now seen corresponding path program 1 times [2022-11-02 20:51:39,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:39,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653730360] [2022-11-02 20:51:39,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:39,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:39,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:39,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-11-02 20:51:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-02 20:51:39,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:39,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:39,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653730360] [2022-11-02 20:51:39,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653730360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:39,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:39,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:51:39,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394770925] [2022-11-02 20:51:39,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:39,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:51:39,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:39,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:51:39,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:51:39,633 INFO L87 Difference]: Start difference. First operand 626 states and 952 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-02 20:51:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:42,151 INFO L93 Difference]: Finished difference Result 1659 states and 2412 transitions. [2022-11-02 20:51:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:51:42,152 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) Word has length 65 [2022-11-02 20:51:42,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:42,161 INFO L225 Difference]: With dead ends: 1659 [2022-11-02 20:51:42,162 INFO L226 Difference]: Without dead ends: 1438 [2022-11-02 20:51:42,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:51:42,165 INFO L413 NwaCegarLoop]: 927 mSDtfsCounter, 4541 mSDsluCounter, 2016 mSDsCounter, 0 mSdLazyCounter, 1775 mSolverCounterSat, 751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 2943 SdHoareTripleChecker+Invalid, 2526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 751 IncrementalHoareTripleChecker+Valid, 1775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:42,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 2943 Invalid, 2526 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [751 Valid, 1775 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:51:42,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2022-11-02 20:51:42,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 1299. [2022-11-02 20:51:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1299 states, 1089 states have (on average 1.4471992653810835) internal successors, (1576), 1103 states have internal predecessors, (1576), 127 states have call successors, (127), 74 states have call predecessors, (127), 81 states have return successors, (139), 123 states have call predecessors, (139), 125 states have call successors, (139) [2022-11-02 20:51:42,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1299 states to 1299 states and 1842 transitions. [2022-11-02 20:51:42,344 INFO L78 Accepts]: Start accepts. Automaton has 1299 states and 1842 transitions. Word has length 65 [2022-11-02 20:51:42,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:42,345 INFO L495 AbstractCegarLoop]: Abstraction has 1299 states and 1842 transitions. [2022-11-02 20:51:42,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 7 states have internal predecessors, (50), 5 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 5 states have call successors, (7) [2022-11-02 20:51:42,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1299 states and 1842 transitions. [2022-11-02 20:51:42,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:51:42,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:42,353 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:42,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 20:51:42,354 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:42,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:42,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1163818986, now seen corresponding path program 1 times [2022-11-02 20:51:42,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:42,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44616376] [2022-11-02 20:51:42,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:42,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:42,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:42,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:51:42,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:51:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:42,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:42,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44616376] [2022-11-02 20:51:42,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44616376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:42,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:42,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024384549] [2022-11-02 20:51:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:42,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:42,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:42,617 INFO L87 Difference]: Start difference. First operand 1299 states and 1842 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:51:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:44,256 INFO L93 Difference]: Finished difference Result 2325 states and 3236 transitions. [2022-11-02 20:51:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 20:51:44,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 66 [2022-11-02 20:51:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:44,264 INFO L225 Difference]: With dead ends: 2325 [2022-11-02 20:51:44,264 INFO L226 Difference]: Without dead ends: 1437 [2022-11-02 20:51:44,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:51:44,268 INFO L413 NwaCegarLoop]: 783 mSDtfsCounter, 1052 mSDsluCounter, 2322 mSDsCounter, 0 mSdLazyCounter, 1771 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1053 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 1922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:44,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1053 Valid, 3105 Invalid, 1922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1771 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:51:44,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2022-11-02 20:51:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 1329. [2022-11-02 20:51:44,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1113 states have (on average 1.4348607367475292) internal successors, (1597), 1127 states have internal predecessors, (1597), 127 states have call successors, (127), 74 states have call predecessors, (127), 87 states have return successors, (145), 129 states have call predecessors, (145), 125 states have call successors, (145) [2022-11-02 20:51:44,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1869 transitions. [2022-11-02 20:51:44,426 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1869 transitions. Word has length 66 [2022-11-02 20:51:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:44,428 INFO L495 AbstractCegarLoop]: Abstraction has 1329 states and 1869 transitions. [2022-11-02 20:51:44,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 5 states have internal predecessors, (51), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:51:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1869 transitions. [2022-11-02 20:51:44,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-02 20:51:44,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:44,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:44,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 20:51:44,433 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:44,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:44,434 INFO L85 PathProgramCache]: Analyzing trace with hash 134459688, now seen corresponding path program 1 times [2022-11-02 20:51:44,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:44,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591023656] [2022-11-02 20:51:44,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:44,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:44,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:44,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-02 20:51:44,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-02 20:51:44,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:44,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:51:44,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:44,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591023656] [2022-11-02 20:51:44,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591023656] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:44,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:44,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-02 20:51:44,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376714665] [2022-11-02 20:51:44,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:44,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-02 20:51:44,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:44,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-02 20:51:44,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-02 20:51:44,679 INFO L87 Difference]: Start difference. First operand 1329 states and 1869 transitions. Second operand has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:51:47,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:47,258 INFO L93 Difference]: Finished difference Result 3667 states and 5056 transitions. [2022-11-02 20:51:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-11-02 20:51:47,258 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 66 [2022-11-02 20:51:47,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:47,266 INFO L225 Difference]: With dead ends: 3667 [2022-11-02 20:51:47,266 INFO L226 Difference]: Without dead ends: 1572 [2022-11-02 20:51:47,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2022-11-02 20:51:47,272 INFO L413 NwaCegarLoop]: 914 mSDtfsCounter, 4601 mSDsluCounter, 2053 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4621 SdHoareTripleChecker+Valid, 2967 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:47,273 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4621 Valid, 2967 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:51:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1572 states. [2022-11-02 20:51:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1572 to 1417. [2022-11-02 20:51:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1166 states have (on average 1.4013722126929673) internal successors, (1634), 1180 states have internal predecessors, (1634), 147 states have call successors, (147), 88 states have call predecessors, (147), 102 states have return successors, (166), 150 states have call predecessors, (166), 145 states have call successors, (166) [2022-11-02 20:51:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1947 transitions. [2022-11-02 20:51:47,371 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1947 transitions. Word has length 66 [2022-11-02 20:51:47,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:47,371 INFO L495 AbstractCegarLoop]: Abstraction has 1417 states and 1947 transitions. [2022-11-02 20:51:47,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.1) internal successors, (51), 7 states have internal predecessors, (51), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2022-11-02 20:51:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1947 transitions. [2022-11-02 20:51:47,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:51:47,373 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:47,373 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:47,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 20:51:47,374 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:47,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:47,375 INFO L85 PathProgramCache]: Analyzing trace with hash -949162084, now seen corresponding path program 1 times [2022-11-02 20:51:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:47,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16880057] [2022-11-02 20:51:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:47,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:47,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:47,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:47,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:51:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:47,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16880057] [2022-11-02 20:51:47,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16880057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:47,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:47,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:47,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448377318] [2022-11-02 20:51:47,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:47,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:47,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:47,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:47,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:47,554 INFO L87 Difference]: Start difference. First operand 1417 states and 1947 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:51:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:49,161 INFO L93 Difference]: Finished difference Result 2594 states and 3498 transitions. [2022-11-02 20:51:49,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:49,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 91 [2022-11-02 20:51:49,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:49,169 INFO L225 Difference]: With dead ends: 2594 [2022-11-02 20:51:49,169 INFO L226 Difference]: Without dead ends: 1588 [2022-11-02 20:51:49,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-02 20:51:49,173 INFO L413 NwaCegarLoop]: 770 mSDtfsCounter, 698 mSDsluCounter, 2640 mSDsCounter, 0 mSdLazyCounter, 1798 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 3410 SdHoareTripleChecker+Invalid, 1901 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:49,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 3410 Invalid, 1901 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1798 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-11-02 20:51:49,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2022-11-02 20:51:49,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1457. [2022-11-02 20:51:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1457 states, 1198 states have (on average 1.3881469115191987) internal successors, (1663), 1212 states have internal predecessors, (1663), 147 states have call successors, (147), 88 states have call predecessors, (147), 110 states have return successors, (174), 158 states have call predecessors, (174), 145 states have call successors, (174) [2022-11-02 20:51:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1457 states to 1457 states and 1984 transitions. [2022-11-02 20:51:49,286 INFO L78 Accepts]: Start accepts. Automaton has 1457 states and 1984 transitions. Word has length 91 [2022-11-02 20:51:49,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:49,287 INFO L495 AbstractCegarLoop]: Abstraction has 1457 states and 1984 transitions. [2022-11-02 20:51:49,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 5 states have internal predecessors, (62), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-02 20:51:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1457 states and 1984 transitions. [2022-11-02 20:51:49,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:51:49,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:49,294 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:49,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 20:51:49,295 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:49,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:49,295 INFO L85 PathProgramCache]: Analyzing trace with hash -505261410, now seen corresponding path program 1 times [2022-11-02 20:51:49,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:49,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350384955] [2022-11-02 20:51:49,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:49,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:49,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:49,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:49,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:51:49,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350384955] [2022-11-02 20:51:49,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [350384955] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:49,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:49,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 20:51:49,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209987476] [2022-11-02 20:51:49,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:49,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 20:51:49,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:49,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 20:51:49,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:51:49,550 INFO L87 Difference]: Start difference. First operand 1457 states and 1984 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:51:51,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:51,142 INFO L93 Difference]: Finished difference Result 3495 states and 4589 transitions. [2022-11-02 20:51:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 20:51:51,143 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-02 20:51:51,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:51,154 INFO L225 Difference]: With dead ends: 3495 [2022-11-02 20:51:51,154 INFO L226 Difference]: Without dead ends: 2450 [2022-11-02 20:51:51,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2022-11-02 20:51:51,158 INFO L413 NwaCegarLoop]: 801 mSDtfsCounter, 1557 mSDsluCounter, 1930 mSDsCounter, 0 mSdLazyCounter, 1406 mSolverCounterSat, 161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1591 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 161 IncrementalHoareTripleChecker+Valid, 1406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:51,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1591 Valid, 2731 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [161 Valid, 1406 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-11-02 20:51:51,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2022-11-02 20:51:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2134. [2022-11-02 20:51:51,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1727 states have (on average 1.3474232773595831) internal successors, (2327), 1754 states have internal predecessors, (2327), 223 states have call successors, (223), 141 states have call predecessors, (223), 182 states have return successors, (287), 241 states have call predecessors, (287), 221 states have call successors, (287) [2022-11-02 20:51:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2837 transitions. [2022-11-02 20:51:51,313 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2837 transitions. Word has length 91 [2022-11-02 20:51:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:51,314 INFO L495 AbstractCegarLoop]: Abstraction has 2134 states and 2837 transitions. [2022-11-02 20:51:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:51:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2837 transitions. [2022-11-02 20:51:51,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:51:51,316 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:51,316 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:51,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 20:51:51,317 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:51,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:51,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1433900636, now seen corresponding path program 1 times [2022-11-02 20:51:51,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:51,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501317252] [2022-11-02 20:51:51,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:51,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:51,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:51,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:51,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:51,475 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-02 20:51:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:51,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501317252] [2022-11-02 20:51:51,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501317252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:51,476 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:51,476 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:51:51,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381978614] [2022-11-02 20:51:51,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:51,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:51:51,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:51,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:51:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:51:51,478 INFO L87 Difference]: Start difference. First operand 2134 states and 2837 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:51:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:52,256 INFO L93 Difference]: Finished difference Result 5793 states and 7619 transitions. [2022-11-02 20:51:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 20:51:52,257 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 91 [2022-11-02 20:51:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:52,281 INFO L225 Difference]: With dead ends: 5793 [2022-11-02 20:51:52,281 INFO L226 Difference]: Without dead ends: 4073 [2022-11-02 20:51:52,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2022-11-02 20:51:52,289 INFO L413 NwaCegarLoop]: 772 mSDtfsCounter, 2219 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2254 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:52,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2254 Valid, 1557 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-02 20:51:52,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2022-11-02 20:51:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3853. [2022-11-02 20:51:52,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 3065 states have (on average 1.301794453507341) internal successors, (3990), 3128 states have internal predecessors, (3990), 416 states have call successors, (416), 275 states have call predecessors, (416), 370 states have return successors, (627), 454 states have call predecessors, (627), 414 states have call successors, (627) [2022-11-02 20:51:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5033 transitions. [2022-11-02 20:51:52,594 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5033 transitions. Word has length 91 [2022-11-02 20:51:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:52,595 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 5033 transitions. [2022-11-02 20:51:52,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 4 states have internal predecessors, (70), 4 states have call successors, (9), 5 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-11-02 20:51:52,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5033 transitions. [2022-11-02 20:51:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-11-02 20:51:52,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:52,599 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:52,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 20:51:52,599 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash 376062558, now seen corresponding path program 1 times [2022-11-02 20:51:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:52,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743903080] [2022-11-02 20:51:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:52,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-02 20:51:52,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-02 20:51:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:52,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743903080] [2022-11-02 20:51:52,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743903080] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:52,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:52,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:51:52,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484850651] [2022-11-02 20:51:52,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:52,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:51:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:52,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:51:52,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:51:52,689 INFO L87 Difference]: Start difference. First operand 3853 states and 5033 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:51:53,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:53,533 INFO L93 Difference]: Finished difference Result 5691 states and 7336 transitions. [2022-11-02 20:51:53,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-02 20:51:53,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 91 [2022-11-02 20:51:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:53,545 INFO L225 Difference]: With dead ends: 5691 [2022-11-02 20:51:53,545 INFO L226 Difference]: Without dead ends: 2252 [2022-11-02 20:51:53,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:53,552 INFO L413 NwaCegarLoop]: 767 mSDtfsCounter, 1154 mSDsluCounter, 1016 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1171 SdHoareTripleChecker+Valid, 1783 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:53,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1171 Valid, 1783 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-02 20:51:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2022-11-02 20:51:53,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2134. [2022-11-02 20:51:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2134 states, 1727 states have (on average 1.322524609148813) internal successors, (2284), 1754 states have internal predecessors, (2284), 223 states have call successors, (223), 141 states have call predecessors, (223), 182 states have return successors, (287), 241 states have call predecessors, (287), 221 states have call successors, (287) [2022-11-02 20:51:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 2794 transitions. [2022-11-02 20:51:53,757 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 2794 transitions. Word has length 91 [2022-11-02 20:51:53,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:53,759 INFO L495 AbstractCegarLoop]: Abstraction has 2134 states and 2794 transitions. [2022-11-02 20:51:53,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 3 states have internal predecessors, (62), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-02 20:51:53,759 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 2794 transitions. [2022-11-02 20:51:53,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-02 20:51:53,762 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:53,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:53,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 20:51:53,763 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:53,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1860606532, now seen corresponding path program 1 times [2022-11-02 20:51:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:53,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123053494] [2022-11-02 20:51:53,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:53,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:53,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:51:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:53,953 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-02 20:51:53,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:53,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123053494] [2022-11-02 20:51:53,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123053494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:53,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:51:53,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 20:51:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985423789] [2022-11-02 20:51:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 20:51:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:53,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 20:51:53,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-02 20:51:53,957 INFO L87 Difference]: Start difference. First operand 2134 states and 2794 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:51:55,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:55,881 INFO L93 Difference]: Finished difference Result 4960 states and 6396 transitions. [2022-11-02 20:51:55,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 20:51:55,881 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 92 [2022-11-02 20:51:55,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:55,894 INFO L225 Difference]: With dead ends: 4960 [2022-11-02 20:51:55,894 INFO L226 Difference]: Without dead ends: 2933 [2022-11-02 20:51:55,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2022-11-02 20:51:55,919 INFO L413 NwaCegarLoop]: 861 mSDtfsCounter, 2131 mSDsluCounter, 2013 mSDsCounter, 0 mSdLazyCounter, 1573 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2174 SdHoareTripleChecker+Valid, 2874 SdHoareTripleChecker+Invalid, 1980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 1573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:55,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2174 Valid, 2874 Invalid, 1980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 1573 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-11-02 20:51:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2933 states. [2022-11-02 20:51:56,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2933 to 2756. [2022-11-02 20:51:56,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2756 states, 2193 states have (on average 1.2836297309621523) internal successors, (2815), 2228 states have internal predecessors, (2815), 301 states have call successors, (301), 189 states have call predecessors, (301), 260 states have return successors, (420), 341 states have call predecessors, (420), 299 states have call successors, (420) [2022-11-02 20:51:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2756 states to 2756 states and 3536 transitions. [2022-11-02 20:51:56,137 INFO L78 Accepts]: Start accepts. Automaton has 2756 states and 3536 transitions. Word has length 92 [2022-11-02 20:51:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:56,137 INFO L495 AbstractCegarLoop]: Abstraction has 2756 states and 3536 transitions. [2022-11-02 20:51:56,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 6 states have internal predecessors, (74), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-02 20:51:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 2756 states and 3536 transitions. [2022-11-02 20:51:56,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 20:51:56,142 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:56,142 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:56,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 20:51:56,143 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:56,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:56,143 INFO L85 PathProgramCache]: Analyzing trace with hash 402118481, now seen corresponding path program 1 times [2022-11-02 20:51:56,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:56,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823386540] [2022-11-02 20:51:56,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:56,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:56,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:56,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:56,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:51:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:51:56,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:51:56,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:51:56,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:56,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:56,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 20:51:56,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-02 20:51:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 20:51:56,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 20:51:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,423 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-02 20:51:56,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:56,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823386540] [2022-11-02 20:51:56,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823386540] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:56,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268349078] [2022-11-02 20:51:56,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:56,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:56,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:56,432 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:56,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 20:51:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:56,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 642 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:51:56,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:56,871 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-02 20:51:56,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:51:56,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [268349078] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:56,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:51:56,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:51:56,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907637188] [2022-11-02 20:51:56,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:56,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:56,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:56,884 INFO L87 Difference]: Start difference. First operand 2756 states and 3536 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:51:57,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:57,289 INFO L93 Difference]: Finished difference Result 7081 states and 8851 transitions. [2022-11-02 20:51:57,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:57,289 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 163 [2022-11-02 20:51:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:57,308 INFO L225 Difference]: With dead ends: 7081 [2022-11-02 20:51:57,308 INFO L226 Difference]: Without dead ends: 4893 [2022-11-02 20:51:57,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:57,315 INFO L413 NwaCegarLoop]: 793 mSDtfsCounter, 61 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:57,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1553 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:51:57,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4893 states. [2022-11-02 20:51:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4893 to 4848. [2022-11-02 20:51:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4848 states, 3818 states have (on average 1.247511786275537) internal successors, (4763), 3882 states have internal predecessors, (4763), 535 states have call successors, (535), 371 states have call predecessors, (535), 493 states have return successors, (727), 597 states have call predecessors, (727), 533 states have call successors, (727) [2022-11-02 20:51:57,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4848 states to 4848 states and 6025 transitions. [2022-11-02 20:51:57,737 INFO L78 Accepts]: Start accepts. Automaton has 4848 states and 6025 transitions. Word has length 163 [2022-11-02 20:51:57,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:51:57,738 INFO L495 AbstractCegarLoop]: Abstraction has 4848 states and 6025 transitions. [2022-11-02 20:51:57,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 20:51:57,738 INFO L276 IsEmpty]: Start isEmpty. Operand 4848 states and 6025 transitions. [2022-11-02 20:51:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-02 20:51:57,743 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:51:57,743 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:51:57,780 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-02 20:51:57,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-02 20:51:57,968 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:51:57,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:51:57,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2105074836, now seen corresponding path program 1 times [2022-11-02 20:51:57,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:51:57,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620433832] [2022-11-02 20:51:57,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:57,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:51:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:51:58,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:51:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:58,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:51:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:51:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:51:58,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:51:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:51:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:51:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:51:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:51:58,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:51:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:51:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:51:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:51:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:51:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:51:58,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-02 20:51:58,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-02 20:51:58,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:51:58,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620433832] [2022-11-02 20:51:58,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620433832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:51:58,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227297745] [2022-11-02 20:51:58,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:51:58,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:51:58,232 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:51:58,237 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:51:58,266 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-02 20:51:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:51:58,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:51:58,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:51:58,686 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-11-02 20:51:58,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:51:58,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227297745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:51:58,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:51:58,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:51:58,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611687615] [2022-11-02 20:51:58,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:51:58,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:51:58,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:51:58,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:51:58,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:58,689 INFO L87 Difference]: Start difference. First operand 4848 states and 6025 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:51:59,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:51:59,453 INFO L93 Difference]: Finished difference Result 13716 states and 16763 transitions. [2022-11-02 20:51:59,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:51:59,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 195 [2022-11-02 20:51:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:51:59,503 INFO L225 Difference]: With dead ends: 13716 [2022-11-02 20:51:59,503 INFO L226 Difference]: Without dead ends: 9282 [2022-11-02 20:51:59,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:51:59,516 INFO L413 NwaCegarLoop]: 790 mSDtfsCounter, 52 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1553 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:51:59,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1553 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:51:59,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9282 states. [2022-11-02 20:52:00,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9282 to 9272. [2022-11-02 20:52:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9272 states, 7255 states have (on average 1.2238456237077877) internal successors, (8879), 7379 states have internal predecessors, (8879), 1035 states have call successors, (1035), 735 states have call predecessors, (1035), 980 states have return successors, (1420), 1160 states have call predecessors, (1420), 1033 states have call successors, (1420) [2022-11-02 20:52:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9272 states to 9272 states and 11334 transitions. [2022-11-02 20:52:00,273 INFO L78 Accepts]: Start accepts. Automaton has 9272 states and 11334 transitions. Word has length 195 [2022-11-02 20:52:00,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:00,273 INFO L495 AbstractCegarLoop]: Abstraction has 9272 states and 11334 transitions. [2022-11-02 20:52:00,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 20:52:00,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9272 states and 11334 transitions. [2022-11-02 20:52:00,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2022-11-02 20:52:00,281 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:00,281 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:00,317 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:00,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-11-02 20:52:00,496 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:00,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:00,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1292499182, now seen corresponding path program 1 times [2022-11-02 20:52:00,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:00,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451882535] [2022-11-02 20:52:00,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:00,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:00,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:00,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:52:00,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 20:52:00,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 20:52:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-02 20:52:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-02 20:52:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 20:52:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-02 20:52:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-02 20:52:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-02 20:52:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-02 20:52:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-02 20:52:00,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 20:52:00,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 20:52:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 20:52:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 20:52:00,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 20:52:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-11-02 20:52:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2022-11-02 20:52:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451882535] [2022-11-02 20:52:00,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451882535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 20:52:00,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571631091] [2022-11-02 20:52:00,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:00,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:00,837 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 20:52:00,838 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 20:52:00,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-02 20:52:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:01,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 711 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 20:52:01,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 20:52:01,370 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2022-11-02 20:52:01,370 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 20:52:01,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571631091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:01,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 20:52:01,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 20:52:01,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565242101] [2022-11-02 20:52:01,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:01,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 20:52:01,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:01,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 20:52:01,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:01,373 INFO L87 Difference]: Start difference. First operand 9272 states and 11334 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-02 20:52:02,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:02,016 INFO L93 Difference]: Finished difference Result 15802 states and 19574 transitions. [2022-11-02 20:52:02,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 20:52:02,017 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 195 [2022-11-02 20:52:02,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:02,023 INFO L225 Difference]: With dead ends: 15802 [2022-11-02 20:52:02,024 INFO L226 Difference]: Without dead ends: 403 [2022-11-02 20:52:02,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:02,054 INFO L413 NwaCegarLoop]: 765 mSDtfsCounter, 661 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:02,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 765 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 20:52:02,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-11-02 20:52:02,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2022-11-02 20:52:02,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 369 states have (on average 1.5799457994579946) internal successors, (583), 370 states have internal predecessors, (583), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-02 20:52:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 637 transitions. [2022-11-02 20:52:02,089 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 637 transitions. Word has length 195 [2022-11-02 20:52:02,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:02,089 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 637 transitions. [2022-11-02 20:52:02,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-02 20:52:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 637 transitions. [2022-11-02 20:52:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:02,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:02,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:02,134 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-02 20:52:02,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_94e84507-a2bd-4089-b95a-153fe17cb0ae/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 20:52:02,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:02,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash -999047694, now seen corresponding path program 1 times [2022-11-02 20:52:02,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:02,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748585217] [2022-11-02 20:52:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:02,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:02,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:02,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748585217] [2022-11-02 20:52:02,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748585217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:02,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:02,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:02,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616290142] [2022-11-02 20:52:02,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:02,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:02,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:02,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:02,536 INFO L87 Difference]: Start difference. First operand 403 states and 637 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:04,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:04,701 INFO L93 Difference]: Finished difference Result 947 states and 1519 transitions. [2022-11-02 20:52:04,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:04,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:04,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:04,704 INFO L225 Difference]: With dead ends: 947 [2022-11-02 20:52:04,705 INFO L226 Difference]: Without dead ends: 556 [2022-11-02 20:52:04,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:04,706 INFO L413 NwaCegarLoop]: 703 mSDtfsCounter, 1100 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1125 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:04,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1125 Valid, 1121 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:52:04,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-02 20:52:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 403. [2022-11-02 20:52:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 369 states have (on average 1.5772357723577235) internal successors, (582), 370 states have internal predecessors, (582), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-02 20:52:04,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 636 transitions. [2022-11-02 20:52:04,754 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 636 transitions. Word has length 189 [2022-11-02 20:52:04,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:04,755 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 636 transitions. [2022-11-02 20:52:04,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 636 transitions. [2022-11-02 20:52:04,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:04,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:04,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:04,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 20:52:04,758 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:04,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:04,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1604822476, now seen corresponding path program 1 times [2022-11-02 20:52:04,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:04,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108764057] [2022-11-02 20:52:04,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:04,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:04,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:04,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:04,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:04,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108764057] [2022-11-02 20:52:04,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108764057] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:04,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:04,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-02 20:52:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063439522] [2022-11-02 20:52:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:04,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-02 20:52:04,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:04,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-02 20:52:04,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-02 20:52:04,955 INFO L87 Difference]: Start difference. First operand 403 states and 636 transitions. Second operand has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:06,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:06,886 INFO L93 Difference]: Finished difference Result 939 states and 1502 transitions. [2022-11-02 20:52:06,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-02 20:52:06,886 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:06,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:06,889 INFO L225 Difference]: With dead ends: 939 [2022-11-02 20:52:06,889 INFO L226 Difference]: Without dead ends: 556 [2022-11-02 20:52:06,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-02 20:52:06,892 INFO L413 NwaCegarLoop]: 702 mSDtfsCounter, 1091 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1116 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:06,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1116 Valid, 1119 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-11-02 20:52:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-11-02 20:52:06,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 403. [2022-11-02 20:52:06,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 369 states have (on average 1.5745257452574526) internal successors, (581), 370 states have internal predecessors, (581), 27 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-02 20:52:06,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 635 transitions. [2022-11-02 20:52:06,946 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 635 transitions. Word has length 189 [2022-11-02 20:52:06,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:06,946 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 635 transitions. [2022-11-02 20:52:06,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.8) internal successors, (179), 3 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:06,947 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 635 transitions. [2022-11-02 20:52:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:06,949 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:06,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:06,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 20:52:06,950 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:06,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:06,950 INFO L85 PathProgramCache]: Analyzing trace with hash -914990986, now seen corresponding path program 1 times [2022-11-02 20:52:06,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:06,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884958836] [2022-11-02 20:52:06,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:06,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:07,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:07,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:07,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884958836] [2022-11-02 20:52:07,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884958836] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:07,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:07,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 20:52:07,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66216412] [2022-11-02 20:52:07,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:07,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 20:52:07,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:07,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 20:52:07,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 20:52:07,189 INFO L87 Difference]: Start difference. First operand 403 states and 635 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:11,352 INFO L93 Difference]: Finished difference Result 1491 states and 2402 transitions. [2022-11-02 20:52:11,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 20:52:11,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:11,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:11,358 INFO L225 Difference]: With dead ends: 1491 [2022-11-02 20:52:11,358 INFO L226 Difference]: Without dead ends: 1110 [2022-11-02 20:52:11,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:11,360 INFO L413 NwaCegarLoop]: 758 mSDtfsCounter, 1667 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1687 SdHoareTripleChecker+Valid, 1766 SdHoareTripleChecker+Invalid, 2280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:11,360 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1687 Valid, 1766 Invalid, 2280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 20:52:11,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2022-11-02 20:52:11,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 805. [2022-11-02 20:52:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 742 states have (on average 1.587601078167116) internal successors, (1178), 744 states have internal predecessors, (1178), 49 states have call successors, (49), 12 states have call predecessors, (49), 13 states have return successors, (52), 49 states have call predecessors, (52), 49 states have call successors, (52) [2022-11-02 20:52:11,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1279 transitions. [2022-11-02 20:52:11,511 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1279 transitions. Word has length 189 [2022-11-02 20:52:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:11,512 INFO L495 AbstractCegarLoop]: Abstraction has 805 states and 1279 transitions. [2022-11-02 20:52:11,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 4 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1279 transitions. [2022-11-02 20:52:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:11,515 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:11,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:11,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 20:52:11,515 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:11,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:11,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1103637498, now seen corresponding path program 1 times [2022-11-02 20:52:11,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:11,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794226441] [2022-11-02 20:52:11,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:11,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:11,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:11,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:11,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:11,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:11,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:11,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794226441] [2022-11-02 20:52:11,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794226441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:11,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:11,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:11,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702273779] [2022-11-02 20:52:11,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:11,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:11,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:11,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:11,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:11,793 INFO L87 Difference]: Start difference. First operand 805 states and 1279 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:17,047 INFO L93 Difference]: Finished difference Result 2469 states and 3985 transitions. [2022-11-02 20:52:17,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:17,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:17,058 INFO L225 Difference]: With dead ends: 2469 [2022-11-02 20:52:17,058 INFO L226 Difference]: Without dead ends: 1686 [2022-11-02 20:52:17,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:17,066 INFO L413 NwaCegarLoop]: 1081 mSDtfsCounter, 1700 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3358 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1720 SdHoareTripleChecker+Valid, 3082 SdHoareTripleChecker+Invalid, 3435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:17,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1720 Valid, 3082 Invalid, 3435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3358 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-02 20:52:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1686 states. [2022-11-02 20:52:17,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1686 to 1178. [2022-11-02 20:52:17,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1178 states, 1086 states have (on average 1.5810313075506446) internal successors, (1717), 1089 states have internal predecessors, (1717), 71 states have call successors, (71), 18 states have call predecessors, (71), 20 states have return successors, (76), 72 states have call predecessors, (76), 71 states have call successors, (76) [2022-11-02 20:52:17,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1178 states to 1178 states and 1864 transitions. [2022-11-02 20:52:17,247 INFO L78 Accepts]: Start accepts. Automaton has 1178 states and 1864 transitions. Word has length 189 [2022-11-02 20:52:17,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:17,247 INFO L495 AbstractCegarLoop]: Abstraction has 1178 states and 1864 transitions. [2022-11-02 20:52:17,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1178 states and 1864 transitions. [2022-11-02 20:52:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:17,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:17,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:17,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 20:52:17,251 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:17,251 INFO L85 PathProgramCache]: Analyzing trace with hash -620970824, now seen corresponding path program 1 times [2022-11-02 20:52:17,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:17,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755040712] [2022-11-02 20:52:17,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:17,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:17,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:17,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:17,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:17,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:17,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:17,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755040712] [2022-11-02 20:52:17,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755040712] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:17,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:17,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:17,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836098827] [2022-11-02 20:52:17,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:17,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:17,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:17,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:17,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:17,587 INFO L87 Difference]: Start difference. First operand 1178 states and 1864 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:22,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:22,821 INFO L93 Difference]: Finished difference Result 3911 states and 6298 transitions. [2022-11-02 20:52:22,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:22,821 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:22,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:22,833 INFO L225 Difference]: With dead ends: 3911 [2022-11-02 20:52:22,833 INFO L226 Difference]: Without dead ends: 2755 [2022-11-02 20:52:22,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:22,839 INFO L413 NwaCegarLoop]: 1073 mSDtfsCounter, 1697 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3360 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 3074 SdHoareTripleChecker+Invalid, 3440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 3360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:22,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 3074 Invalid, 3440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 3360 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-02 20:52:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2022-11-02 20:52:23,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1925. [2022-11-02 20:52:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1775 states have (on average 1.5752112676056338) internal successors, (2796), 1780 states have internal predecessors, (2796), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-11-02 20:52:23,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3039 transitions. [2022-11-02 20:52:23,200 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3039 transitions. Word has length 189 [2022-11-02 20:52:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:23,200 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 3039 transitions. [2022-11-02 20:52:23,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:23,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3039 transitions. [2022-11-02 20:52:23,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:23,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:23,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:23,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 20:52:23,204 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:23,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:23,204 INFO L85 PathProgramCache]: Analyzing trace with hash -122414022, now seen corresponding path program 1 times [2022-11-02 20:52:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:23,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886139452] [2022-11-02 20:52:23,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:23,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:23,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:23,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:23,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:23,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:23,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:23,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:23,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886139452] [2022-11-02 20:52:23,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886139452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:23,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:23,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:23,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37309773] [2022-11-02 20:52:23,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:23,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:23,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:23,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:23,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:23,533 INFO L87 Difference]: Start difference. First operand 1925 states and 3039 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:26,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:26,139 INFO L93 Difference]: Finished difference Result 4648 states and 7466 transitions. [2022-11-02 20:52:26,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:26,140 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:26,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:26,149 INFO L225 Difference]: With dead ends: 4648 [2022-11-02 20:52:26,149 INFO L226 Difference]: Without dead ends: 2745 [2022-11-02 20:52:26,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:26,155 INFO L413 NwaCegarLoop]: 693 mSDtfsCounter, 1378 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1399 SdHoareTripleChecker+Valid, 1482 SdHoareTripleChecker+Invalid, 1542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:26,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1399 Valid, 1482 Invalid, 1542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-11-02 20:52:26,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2745 states. [2022-11-02 20:52:26,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2745 to 1925. [2022-11-02 20:52:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1775 states have (on average 1.572394366197183) internal successors, (2791), 1780 states have internal predecessors, (2791), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-11-02 20:52:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3034 transitions. [2022-11-02 20:52:26,490 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3034 transitions. Word has length 189 [2022-11-02 20:52:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:26,491 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 3034 transitions. [2022-11-02 20:52:26,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3034 transitions. [2022-11-02 20:52:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:26,494 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:26,494 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:26,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 20:52:26,494 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:26,495 INFO L85 PathProgramCache]: Analyzing trace with hash 447857784, now seen corresponding path program 1 times [2022-11-02 20:52:26,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:26,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379561941] [2022-11-02 20:52:26,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:26,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:26,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:26,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:26,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:26,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:26,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:26,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379561941] [2022-11-02 20:52:26,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379561941] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:26,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:26,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:26,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183510623] [2022-11-02 20:52:26,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:26,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:26,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:26,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:26,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:26,769 INFO L87 Difference]: Start difference. First operand 1925 states and 3034 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:29,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:29,383 INFO L93 Difference]: Finished difference Result 4642 states and 7440 transitions. [2022-11-02 20:52:29,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:29,385 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:29,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:29,393 INFO L225 Difference]: With dead ends: 4642 [2022-11-02 20:52:29,393 INFO L226 Difference]: Without dead ends: 2739 [2022-11-02 20:52:29,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:29,400 INFO L413 NwaCegarLoop]: 687 mSDtfsCounter, 1379 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1400 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:29,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1400 Valid, 1476 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-11-02 20:52:29,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2739 states. [2022-11-02 20:52:29,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2739 to 1925. [2022-11-02 20:52:29,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1775 states have (on average 1.5695774647887324) internal successors, (2786), 1780 states have internal predecessors, (2786), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-11-02 20:52:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3029 transitions. [2022-11-02 20:52:29,751 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3029 transitions. Word has length 189 [2022-11-02 20:52:29,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:29,751 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 3029 transitions. [2022-11-02 20:52:29,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:29,752 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3029 transitions. [2022-11-02 20:52:29,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:29,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:29,755 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:29,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 20:52:29,755 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:29,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:29,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1851726970, now seen corresponding path program 1 times [2022-11-02 20:52:29,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:29,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880500798] [2022-11-02 20:52:29,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:29,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:29,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:29,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:30,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:30,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880500798] [2022-11-02 20:52:30,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880500798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:30,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:30,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:30,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146344541] [2022-11-02 20:52:30,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:30,019 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:30,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:30,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:30,020 INFO L87 Difference]: Start difference. First operand 1925 states and 3029 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:32,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:32,941 INFO L93 Difference]: Finished difference Result 4630 states and 7402 transitions. [2022-11-02 20:52:32,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:32,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:32,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:32,949 INFO L225 Difference]: With dead ends: 4630 [2022-11-02 20:52:32,950 INFO L226 Difference]: Without dead ends: 2727 [2022-11-02 20:52:32,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:32,958 INFO L413 NwaCegarLoop]: 637 mSDtfsCounter, 1283 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:32,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1633 Invalid, 1580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 1492 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:52:32,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2022-11-02 20:52:33,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 1925. [2022-11-02 20:52:33,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1775 states have (on average 1.5667605633802817) internal successors, (2781), 1780 states have internal predecessors, (2781), 115 states have call successors, (115), 30 states have call predecessors, (115), 34 states have return successors, (128), 118 states have call predecessors, (128), 115 states have call successors, (128) [2022-11-02 20:52:33,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3024 transitions. [2022-11-02 20:52:33,239 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3024 transitions. Word has length 189 [2022-11-02 20:52:33,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:33,239 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 3024 transitions. [2022-11-02 20:52:33,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:33,240 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3024 transitions. [2022-11-02 20:52:33,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:33,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:33,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:33,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 20:52:33,242 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:33,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1775858436, now seen corresponding path program 1 times [2022-11-02 20:52:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:33,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422125755] [2022-11-02 20:52:33,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:33,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:33,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:33,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:33,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:33,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:33,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:33,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:33,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422125755] [2022-11-02 20:52:33,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422125755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:33,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:33,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:33,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053513481] [2022-11-02 20:52:33,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:33,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:33,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:33,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:33,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:33,527 INFO L87 Difference]: Start difference. First operand 1925 states and 3024 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:39,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:39,470 INFO L93 Difference]: Finished difference Result 6657 states and 10597 transitions. [2022-11-02 20:52:39,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:39,471 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:39,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:39,488 INFO L225 Difference]: With dead ends: 6657 [2022-11-02 20:52:39,488 INFO L226 Difference]: Without dead ends: 4754 [2022-11-02 20:52:39,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:39,493 INFO L413 NwaCegarLoop]: 1045 mSDtfsCounter, 1672 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3282 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1692 SdHoareTripleChecker+Valid, 3046 SdHoareTripleChecker+Invalid, 3366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:39,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1692 Valid, 3046 Invalid, 3366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3282 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-02 20:52:39,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4754 states. [2022-11-02 20:52:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4754 to 3438. [2022-11-02 20:52:40,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3438 states, 3172 states have (on average 1.5614754098360655) internal successors, (4953), 3181 states have internal predecessors, (4953), 203 states have call successors, (203), 54 states have call predecessors, (203), 62 states have return successors, (238), 210 states have call predecessors, (238), 203 states have call successors, (238) [2022-11-02 20:52:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3438 states to 3438 states and 5394 transitions. [2022-11-02 20:52:40,237 INFO L78 Accepts]: Start accepts. Automaton has 3438 states and 5394 transitions. Word has length 189 [2022-11-02 20:52:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:40,238 INFO L495 AbstractCegarLoop]: Abstraction has 3438 states and 5394 transitions. [2022-11-02 20:52:40,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3438 states and 5394 transitions. [2022-11-02 20:52:40,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:40,241 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:40,241 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:40,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 20:52:40,242 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:40,243 INFO L85 PathProgramCache]: Analyzing trace with hash 323879994, now seen corresponding path program 1 times [2022-11-02 20:52:40,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:40,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553775696] [2022-11-02 20:52:40,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:40,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:40,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:40,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:40,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:40,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:40,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553775696] [2022-11-02 20:52:40,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553775696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:40,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:40,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:40,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561164751] [2022-11-02 20:52:40,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:40,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:40,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:40,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:40,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:40,639 INFO L87 Difference]: Start difference. First operand 3438 states and 5394 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:47,181 INFO L93 Difference]: Finished difference Result 12200 states and 19381 transitions. [2022-11-02 20:52:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:52:47,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:47,213 INFO L225 Difference]: With dead ends: 12200 [2022-11-02 20:52:47,214 INFO L226 Difference]: Without dead ends: 8784 [2022-11-02 20:52:47,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:52:47,223 INFO L413 NwaCegarLoop]: 1040 mSDtfsCounter, 1671 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 3041 SdHoareTripleChecker+Invalid, 3358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:47,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 3041 Invalid, 3358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-02 20:52:47,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8784 states. [2022-11-02 20:52:48,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8784 to 6463. [2022-11-02 20:52:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6463 states, 5965 states have (on average 1.5575859178541491) internal successors, (9291), 5982 states have internal predecessors, (9291), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2022-11-02 20:52:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6463 states to 6463 states and 10146 transitions. [2022-11-02 20:52:48,327 INFO L78 Accepts]: Start accepts. Automaton has 6463 states and 10146 transitions. Word has length 189 [2022-11-02 20:52:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:48,327 INFO L495 AbstractCegarLoop]: Abstraction has 6463 states and 10146 transitions. [2022-11-02 20:52:48,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 6463 states and 10146 transitions. [2022-11-02 20:52:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:48,332 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:48,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:48,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 20:52:48,333 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:48,333 INFO L85 PathProgramCache]: Analyzing trace with hash 668708156, now seen corresponding path program 1 times [2022-11-02 20:52:48,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:48,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467818437] [2022-11-02 20:52:48,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:48,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:48,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:48,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:48,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:48,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467818437] [2022-11-02 20:52:48,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467818437] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:48,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:48,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:48,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912638832] [2022-11-02 20:52:48,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:48,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:48,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:48,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:48,584 INFO L87 Difference]: Start difference. First operand 6463 states and 10146 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:52,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:52:52,818 INFO L93 Difference]: Finished difference Result 15324 states and 24399 transitions. [2022-11-02 20:52:52,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 20:52:52,818 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:52:52,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:52:52,850 INFO L225 Difference]: With dead ends: 15324 [2022-11-02 20:52:52,850 INFO L226 Difference]: Without dead ends: 8883 [2022-11-02 20:52:52,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-02 20:52:52,863 INFO L413 NwaCegarLoop]: 671 mSDtfsCounter, 1197 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 1556 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1218 SdHoareTripleChecker+Valid, 1667 SdHoareTripleChecker+Invalid, 1643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-11-02 20:52:52,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1218 Valid, 1667 Invalid, 1643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1556 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-11-02 20:52:52,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8883 states. [2022-11-02 20:52:53,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8883 to 6463. [2022-11-02 20:52:53,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6463 states, 5965 states have (on average 1.5547359597652977) internal successors, (9274), 5982 states have internal predecessors, (9274), 379 states have call successors, (379), 102 states have call predecessors, (379), 118 states have return successors, (476), 394 states have call predecessors, (476), 379 states have call successors, (476) [2022-11-02 20:52:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6463 states to 6463 states and 10129 transitions. [2022-11-02 20:52:53,999 INFO L78 Accepts]: Start accepts. Automaton has 6463 states and 10129 transitions. Word has length 189 [2022-11-02 20:52:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:52:53,999 INFO L495 AbstractCegarLoop]: Abstraction has 6463 states and 10129 transitions. [2022-11-02 20:52:53,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:52:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 6463 states and 10129 transitions. [2022-11-02 20:52:54,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:52:54,003 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:52:54,003 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:52:54,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-02 20:52:54,004 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:52:54,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:52:54,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1649662970, now seen corresponding path program 1 times [2022-11-02 20:52:54,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:52:54,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017449904] [2022-11-02 20:52:54,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:52:54,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:52:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:52:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:52:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:52:54,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:52:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:52:54,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:52:54,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:52:54,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:52:54,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017449904] [2022-11-02 20:52:54,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017449904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:52:54,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:52:54,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:52:54,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926079190] [2022-11-02 20:52:54,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:52:54,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:52:54,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:52:54,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:52:54,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:52:54,260 INFO L87 Difference]: Start difference. First operand 6463 states and 10129 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:53:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:02,070 INFO L93 Difference]: Finished difference Result 23261 states and 36875 transitions. [2022-11-02 20:53:02,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:02,071 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:53:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:02,122 INFO L225 Difference]: With dead ends: 23261 [2022-11-02 20:53:02,122 INFO L226 Difference]: Without dead ends: 16820 [2022-11-02 20:53:02,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:02,138 INFO L413 NwaCegarLoop]: 1029 mSDtfsCounter, 1663 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3247 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 3030 SdHoareTripleChecker+Invalid, 3331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:02,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 3030 Invalid, 3331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3247 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-11-02 20:53:02,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16820 states. [2022-11-02 20:53:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16820 to 12545. [2022-11-02 20:53:04,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12545 states, 11583 states have (on average 1.5517568850902184) internal successors, (17974), 11616 states have internal predecessors, (17974), 731 states have call successors, (731), 198 states have call predecessors, (731), 230 states have return successors, (1006), 762 states have call predecessors, (1006), 731 states have call successors, (1006) [2022-11-02 20:53:04,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12545 states to 12545 states and 19711 transitions. [2022-11-02 20:53:04,563 INFO L78 Accepts]: Start accepts. Automaton has 12545 states and 19711 transitions. Word has length 189 [2022-11-02 20:53:04,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:04,563 INFO L495 AbstractCegarLoop]: Abstraction has 12545 states and 19711 transitions. [2022-11-02 20:53:04,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:53:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 12545 states and 19711 transitions. [2022-11-02 20:53:04,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:53:04,571 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:04,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:04,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 20:53:04,572 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:04,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash -119808644, now seen corresponding path program 1 times [2022-11-02 20:53:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:04,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537112565] [2022-11-02 20:53:04,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:04,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:53:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:53:04,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:53:04,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:53:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:53:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537112565] [2022-11-02 20:53:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537112565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:04,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:04,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:04,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339188823] [2022-11-02 20:53:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:04,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:04,822 INFO L87 Difference]: Start difference. First operand 12545 states and 19711 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:53:16,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:16,484 INFO L93 Difference]: Finished difference Result 45421 states and 72203 transitions. [2022-11-02 20:53:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:16,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:53:16,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:16,586 INFO L225 Difference]: With dead ends: 45421 [2022-11-02 20:53:16,586 INFO L226 Difference]: Without dead ends: 32898 [2022-11-02 20:53:16,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:16,616 INFO L413 NwaCegarLoop]: 1024 mSDtfsCounter, 1662 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3239 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 3239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:16,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 3025 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 3239 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-11-02 20:53:16,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32898 states. [2022-11-02 20:53:21,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32898 to 24738. [2022-11-02 20:53:21,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24738 states, 22848 states have (on average 1.5500700280112045) internal successors, (35416), 22913 states have internal predecessors, (35416), 1435 states have call successors, (1435), 390 states have call predecessors, (1435), 454 states have return successors, (2228), 1498 states have call predecessors, (2228), 1435 states have call successors, (2228) [2022-11-02 20:53:21,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24738 states to 24738 states and 39079 transitions. [2022-11-02 20:53:21,505 INFO L78 Accepts]: Start accepts. Automaton has 24738 states and 39079 transitions. Word has length 189 [2022-11-02 20:53:21,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:21,505 INFO L495 AbstractCegarLoop]: Abstraction has 24738 states and 39079 transitions. [2022-11-02 20:53:21,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:53:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand 24738 states and 39079 transitions. [2022-11-02 20:53:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:53:21,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:21,518 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:21,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 20:53:21,518 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash -731077702, now seen corresponding path program 1 times [2022-11-02 20:53:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:21,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020917276] [2022-11-02 20:53:21,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:53:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:53:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:53:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:53:21,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:53:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:21,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:21,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:21,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020917276] [2022-11-02 20:53:21,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020917276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:21,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:21,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:21,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947327758] [2022-11-02 20:53:21,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:21,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:21,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:21,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:21,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:21,786 INFO L87 Difference]: Start difference. First operand 24738 states and 39079 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:53:42,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 20:53:42,113 INFO L93 Difference]: Finished difference Result 89740 states and 143457 transitions. [2022-11-02 20:53:42,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-02 20:53:42,114 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 189 [2022-11-02 20:53:42,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 20:53:42,277 INFO L225 Difference]: With dead ends: 89740 [2022-11-02 20:53:42,278 INFO L226 Difference]: Without dead ends: 65024 [2022-11-02 20:53:42,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-02 20:53:42,337 INFO L413 NwaCegarLoop]: 1017 mSDtfsCounter, 1664 mSDsluCounter, 2001 mSDsCounter, 0 mSdLazyCounter, 3228 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1684 SdHoareTripleChecker+Valid, 3018 SdHoareTripleChecker+Invalid, 3315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 3228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 20:53:42,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1684 Valid, 3018 Invalid, 3315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 3228 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 20:53:42,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65024 states. [2022-11-02 20:53:51,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65024 to 49187. [2022-11-02 20:53:51,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49187 states, 45441 states have (on average 1.5491296406329087) internal successors, (70394), 45570 states have internal predecessors, (70394), 2843 states have call successors, (2843), 774 states have call predecessors, (2843), 902 states have return successors, (5158), 2970 states have call predecessors, (5158), 2843 states have call successors, (5158) [2022-11-02 20:53:51,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49187 states to 49187 states and 78395 transitions. [2022-11-02 20:53:51,963 INFO L78 Accepts]: Start accepts. Automaton has 49187 states and 78395 transitions. Word has length 189 [2022-11-02 20:53:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 20:53:51,964 INFO L495 AbstractCegarLoop]: Abstraction has 49187 states and 78395 transitions. [2022-11-02 20:53:51,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-02 20:53:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 49187 states and 78395 transitions. [2022-11-02 20:53:51,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-11-02 20:53:51,988 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 20:53:51,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 20:53:51,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 20:53:51,988 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-02 20:53:51,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 20:53:51,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2136269380, now seen corresponding path program 1 times [2022-11-02 20:53:51,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 20:53:51,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670878964] [2022-11-02 20:53:51,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 20:53:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 20:53:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-02 20:53:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 20:53:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-11-02 20:53:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:52,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 20:53:52,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:52,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 20:53:52,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 20:53:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-02 20:53:52,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 20:53:52,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670878964] [2022-11-02 20:53:52,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670878964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 20:53:52,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 20:53:52,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 20:53:52,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671891999] [2022-11-02 20:53:52,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 20:53:52,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 20:53:52,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 20:53:52,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 20:53:52,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 20:53:52,393 INFO L87 Difference]: Start difference. First operand 49187 states and 78395 transitions. Second operand has 7 states, 7 states have (on average 25.571428571428573) internal successors, (179), 5 states have internal predecessors, (179), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)