./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 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_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a --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 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c --- 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-b5237d8 [2022-11-21 17:06:57,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:06:57,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:06:57,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:06:57,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:06:57,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:06:57,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:06:57,439 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:06:57,441 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:06:57,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:06:57,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:06:57,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:06:57,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:06:57,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:06:57,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:06:57,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:06:57,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:06:57,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:06:57,452 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:06:57,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:06:57,455 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:06:57,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:06:57,465 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:06:57,466 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:06:57,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:06:57,470 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:06:57,470 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:06:57,471 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:06:57,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:06:57,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:06:57,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:06:57,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:06:57,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:06:57,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:06:57,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:06:57,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:06:57,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:06:57,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:06:57,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:06:57,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:06:57,487 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:06:57,488 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 17:06:57,531 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:06:57,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:06:57,532 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:06:57,533 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:06:57,533 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:06:57,534 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:06:57,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:06:57,535 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:06:57,535 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:06:57,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:06:57,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:06:57,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:06:57,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:06:57,537 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:06:57,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:06:57,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:06:57,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:06:57,537 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:06:57,537 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:06:57,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:06:57,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:06:57,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:06:57,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:06:57,538 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:06:57,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:06:57,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:06:57,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:06:57,539 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:06:57,539 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:06:57,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:06:57,540 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:06:57,540 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:06:57,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:06:57,540 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_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/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_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a 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 -> 2cbfaf31aa56f767af01fea9a12ccb47d60ab19076d72b85e8ca46d6ff778e4c [2022-11-21 17:06:57,865 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:06:57,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:06:57,901 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:06:57,903 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:06:57,903 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:06:57,904 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-11-21 17:07:01,057 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:07:01,258 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:07:01,258 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/sv-benchmarks/c/systemc/transmitter.02.cil.c [2022-11-21 17:07:01,270 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/data/1ae31afc6/a00c651ecfa244d8a726e65d61381803/FLAG188ac8671 [2022-11-21 17:07:01,286 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/data/1ae31afc6/a00c651ecfa244d8a726e65d61381803 [2022-11-21 17:07:01,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:07:01,294 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:07:01,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:07:01,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:07:01,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:07:01,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9c57f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01, skipping insertion in model container [2022-11-21 17:07:01,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,317 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:07:01,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:07:01,504 WARN L237 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_acf115a1-0b15-480b-9fb2-494c9b1879ba/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2022-11-21 17:07:01,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:07:01,568 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:07:01,580 WARN L237 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_acf115a1-0b15-480b-9fb2-494c9b1879ba/sv-benchmarks/c/systemc/transmitter.02.cil.c[706,719] [2022-11-21 17:07:01,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:07:01,651 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:07:01,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01 WrapperNode [2022-11-21 17:07:01,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:07:01,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:07:01,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:07:01,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:07:01,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,680 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,702 INFO L138 Inliner]: procedures = 32, calls = 36, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 264 [2022-11-21 17:07:01,702 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:07:01,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:07:01,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:07:01,703 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:07:01,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,729 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,731 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:07:01,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:07:01,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:07:01,737 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:07:01,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (1/1) ... [2022-11-21 17:07:01,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:07:01,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:01,772 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:07:01,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:07:01,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:07:01,815 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2022-11-21 17:07:01,815 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2022-11-21 17:07:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2022-11-21 17:07:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2022-11-21 17:07:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-21 17:07:01,816 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-21 17:07:01,816 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2022-11-21 17:07:01,817 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2022-11-21 17:07:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2022-11-21 17:07:01,818 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2022-11-21 17:07:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:07:01,818 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2022-11-21 17:07:01,818 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2022-11-21 17:07:01,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:07:01,819 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:07:01,947 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:07:01,949 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:07:02,345 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:07:02,353 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:07:02,353 INFO L300 CfgBuilder]: Removed 6 assume(true) statements. [2022-11-21 17:07:02,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:07:02 BoogieIcfgContainer [2022-11-21 17:07:02,356 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:07:02,358 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:07:02,358 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:07:02,362 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:07:02,362 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:07:01" (1/3) ... [2022-11-21 17:07:02,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c124fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:07:02, skipping insertion in model container [2022-11-21 17:07:02,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:07:01" (2/3) ... [2022-11-21 17:07:02,363 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c124fec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:07:02, skipping insertion in model container [2022-11-21 17:07:02,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:07:02" (3/3) ... [2022-11-21 17:07:02,365 INFO L112 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2022-11-21 17:07:02,384 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:07:02,384 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-21 17:07:02,440 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:07:02,447 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;@46a44f2a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:07:02,447 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-21 17:07:02,452 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-21 17:07:02,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:02,464 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:02,464 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] [2022-11-21 17:07:02,465 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 2055872345, now seen corresponding path program 1 times [2022-11-21 17:07:02,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:02,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841379780] [2022-11-21 17:07:02,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:02,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:02,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:02,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:02,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:02,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:02,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:02,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:02,885 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-21 17:07:02,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:02,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841379780] [2022-11-21 17:07:02,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841379780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:02,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:02,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:07:02,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916778415] [2022-11-21 17:07:02,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:02,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:07:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:02,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:07:02,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:07:02,932 INFO L87 Difference]: Start difference. First operand has 128 states, 105 states have (on average 1.561904761904762) internal successors, (164), 107 states have internal predecessors, (164), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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-21 17:07:03,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:03,637 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-11-21 17:07:03,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:07:03,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:03,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:03,655 INFO L225 Difference]: With dead ends: 277 [2022-11-21 17:07:03,656 INFO L226 Difference]: Without dead ends: 153 [2022-11-21 17:07:03,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:07:03,666 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 272 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:03,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 256 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:07:03,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-21 17:07:03,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 123. [2022-11-21 17:07:03,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 102 states have internal predecessors, (145), 15 states have call successors, (15), 6 states have call predecessors, (15), 6 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-11-21 17:07:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2022-11-21 17:07:03,758 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 67 [2022-11-21 17:07:03,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:03,759 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2022-11-21 17:07:03,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 3 states have internal predecessors, (57), 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-21 17:07:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2022-11-21 17:07:03,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:03,765 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:03,766 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] [2022-11-21 17:07:03,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:07:03,766 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:03,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:03,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1622143259, now seen corresponding path program 1 times [2022-11-21 17:07:03,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:03,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644307944] [2022-11-21 17:07:03,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:03,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:03,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:04,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:04,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:04,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:04,103 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-21 17:07:04,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:04,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644307944] [2022-11-21 17:07:04,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644307944] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:04,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:04,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:07:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662133233] [2022-11-21 17:07:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:04,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:07:04,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:04,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:07:04,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:04,115 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-21 17:07:04,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:04,887 INFO L93 Difference]: Finished difference Result 406 states and 597 transitions. [2022-11-21 17:07:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:07:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:04,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:04,891 INFO L225 Difference]: With dead ends: 406 [2022-11-21 17:07:04,891 INFO L226 Difference]: Without dead ends: 293 [2022-11-21 17:07:04,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:07:04,894 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 385 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:04,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 427 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:07:04,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-21 17:07:04,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-11-21 17:07:04,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.443298969072165) internal successors, (280), 196 states have internal predecessors, (280), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-21 17:07:04,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 333 transitions. [2022-11-21 17:07:04,932 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 333 transitions. Word has length 67 [2022-11-21 17:07:04,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:04,932 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 333 transitions. [2022-11-21 17:07:04,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 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-21 17:07:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 333 transitions. [2022-11-21 17:07:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:04,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:04,935 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] [2022-11-21 17:07:04,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:07:04,935 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:04,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:04,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1762963514, now seen corresponding path program 1 times [2022-11-21 17:07:04,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:04,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128431913] [2022-11-21 17:07:04,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:04,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:04,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,122 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-21 17:07:05,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:05,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128431913] [2022-11-21 17:07:05,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128431913] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:05,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:05,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:05,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247209797] [2022-11-21 17:07:05,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:05,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:05,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:05,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:05,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:05,125 INFO L87 Difference]: Start difference. First operand 233 states and 333 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:05,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:05,624 INFO L93 Difference]: Finished difference Result 516 states and 750 transitions. [2022-11-21 17:07:05,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:07:05,625 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:05,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:05,627 INFO L225 Difference]: With dead ends: 516 [2022-11-21 17:07:05,628 INFO L226 Difference]: Without dead ends: 293 [2022-11-21 17:07:05,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:07:05,630 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 291 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 497 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:05,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 378 Invalid, 497 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:07:05,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-11-21 17:07:05,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 233. [2022-11-21 17:07:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 194 states have (on average 1.4329896907216495) internal successors, (278), 196 states have internal predecessors, (278), 25 states have call successors, (25), 12 states have call predecessors, (25), 13 states have return successors, (28), 25 states have call predecessors, (28), 25 states have call successors, (28) [2022-11-21 17:07:05,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 331 transitions. [2022-11-21 17:07:05,695 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 331 transitions. Word has length 67 [2022-11-21 17:07:05,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:05,695 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 331 transitions. [2022-11-21 17:07:05,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:05,696 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 331 transitions. [2022-11-21 17:07:05,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:05,701 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:05,702 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] [2022-11-21 17:07:05,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:07:05,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:05,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:05,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1655984776, now seen corresponding path program 1 times [2022-11-21 17:07:05,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:05,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003958772] [2022-11-21 17:07:05,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:05,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:05,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:05,898 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-21 17:07:05,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:05,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003958772] [2022-11-21 17:07:05,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003958772] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:05,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:05,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:05,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048332181] [2022-11-21 17:07:05,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:05,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:05,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:05,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:05,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:05,902 INFO L87 Difference]: Start difference. First operand 233 states and 331 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:07,098 INFO L93 Difference]: Finished difference Result 689 states and 986 transitions. [2022-11-21 17:07:07,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 17:07:07,098 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:07,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:07,101 INFO L225 Difference]: With dead ends: 689 [2022-11-21 17:07:07,102 INFO L226 Difference]: Without dead ends: 466 [2022-11-21 17:07:07,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2022-11-21 17:07:07,104 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 401 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 1052 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:07,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 767 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1052 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 17:07:07,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-21 17:07:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 337. [2022-11-21 17:07:07,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 281 states have (on average 1.4234875444839858) internal successors, (400), 284 states have internal predecessors, (400), 35 states have call successors, (35), 18 states have call predecessors, (35), 20 states have return successors, (40), 36 states have call predecessors, (40), 35 states have call successors, (40) [2022-11-21 17:07:07,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 475 transitions. [2022-11-21 17:07:07,145 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 475 transitions. Word has length 67 [2022-11-21 17:07:07,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:07,145 INFO L495 AbstractCegarLoop]: Abstraction has 337 states and 475 transitions. [2022-11-21 17:07:07,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:07,146 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 475 transitions. [2022-11-21 17:07:07,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:07,147 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:07,147 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] [2022-11-21 17:07:07,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:07:07,148 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:07,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:07,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1212084102, now seen corresponding path program 1 times [2022-11-21 17:07:07,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:07,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057718417] [2022-11-21 17:07:07,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:07,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:07,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:07,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:07,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:07,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:07,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:07,286 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-21 17:07:07,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:07,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057718417] [2022-11-21 17:07:07,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057718417] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:07,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:07,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:07,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120101781] [2022-11-21 17:07:07,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:07,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:07,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:07,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:07,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:07,292 INFO L87 Difference]: Start difference. First operand 337 states and 475 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:08,456 INFO L93 Difference]: Finished difference Result 1074 states and 1524 transitions. [2022-11-21 17:07:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:07:08,457 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:08,463 INFO L225 Difference]: With dead ends: 1074 [2022-11-21 17:07:08,463 INFO L226 Difference]: Without dead ends: 747 [2022-11-21 17:07:08,465 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:07:08,469 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 410 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:08,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 755 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 17:07:08,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2022-11-21 17:07:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 544. [2022-11-21 17:07:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 456 states have (on average 1.4232456140350878) internal successors, (649), 461 states have internal predecessors, (649), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-21 17:07:08,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 768 transitions. [2022-11-21 17:07:08,564 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 768 transitions. Word has length 67 [2022-11-21 17:07:08,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:08,564 INFO L495 AbstractCegarLoop]: Abstraction has 544 states and 768 transitions. [2022-11-21 17:07:08,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:08,565 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 768 transitions. [2022-11-21 17:07:08,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:08,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:08,566 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] [2022-11-21 17:07:08,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:07:08,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:08,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:08,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1054297084, now seen corresponding path program 1 times [2022-11-21 17:07:08,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:08,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733882562] [2022-11-21 17:07:08,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:08,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:08,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:08,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:08,689 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-21 17:07:08,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:08,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733882562] [2022-11-21 17:07:08,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733882562] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:08,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:08,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:08,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345105779] [2022-11-21 17:07:08,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:08,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:08,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:08,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:08,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:08,692 INFO L87 Difference]: Start difference. First operand 544 states and 768 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:09,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:09,465 INFO L93 Difference]: Finished difference Result 1203 states and 1727 transitions. [2022-11-21 17:07:09,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-21 17:07:09,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:09,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:09,472 INFO L225 Difference]: With dead ends: 1203 [2022-11-21 17:07:09,476 INFO L226 Difference]: Without dead ends: 670 [2022-11-21 17:07:09,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-11-21 17:07:09,483 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 259 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:09,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 532 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:07:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-11-21 17:07:09,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 547. [2022-11-21 17:07:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 547 states, 459 states have (on average 1.411764705882353) internal successors, (648), 464 states have internal predecessors, (648), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-21 17:07:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 767 transitions. [2022-11-21 17:07:09,560 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 767 transitions. Word has length 67 [2022-11-21 17:07:09,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:09,561 INFO L495 AbstractCegarLoop]: Abstraction has 547 states and 767 transitions. [2022-11-21 17:07:09,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:09,561 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 767 transitions. [2022-11-21 17:07:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:09,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:09,563 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] [2022-11-21 17:07:09,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:07:09,564 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:09,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:09,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1302443578, now seen corresponding path program 1 times [2022-11-21 17:07:09,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:09,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918186875] [2022-11-21 17:07:09,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:09,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:09,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:09,677 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-21 17:07:09,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:09,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918186875] [2022-11-21 17:07:09,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918186875] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:09,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:09,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:09,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573687888] [2022-11-21 17:07:09,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:09,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:09,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:09,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:09,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:09,680 INFO L87 Difference]: Start difference. First operand 547 states and 767 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:10,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:10,489 INFO L93 Difference]: Finished difference Result 1269 states and 1814 transitions. [2022-11-21 17:07:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:07:10,490 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:10,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:10,494 INFO L225 Difference]: With dead ends: 1269 [2022-11-21 17:07:10,494 INFO L226 Difference]: Without dead ends: 733 [2022-11-21 17:07:10,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-21 17:07:10,496 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 259 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:10,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 529 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:07:10,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-11-21 17:07:10,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 562. [2022-11-21 17:07:10,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 562 states, 474 states have (on average 1.3987341772151898) internal successors, (663), 479 states have internal predecessors, (663), 53 states have call successors, (53), 30 states have call predecessors, (53), 34 states have return successors, (66), 56 states have call predecessors, (66), 53 states have call successors, (66) [2022-11-21 17:07:10,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 782 transitions. [2022-11-21 17:07:10,561 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 782 transitions. Word has length 67 [2022-11-21 17:07:10,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:10,562 INFO L495 AbstractCegarLoop]: Abstraction has 562 states and 782 transitions. [2022-11-21 17:07:10,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:10,562 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 782 transitions. [2022-11-21 17:07:10,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:07:10,563 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:10,563 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] [2022-11-21 17:07:10,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:07:10,564 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:10,564 INFO L85 PathProgramCache]: Analyzing trace with hash 908076792, now seen corresponding path program 1 times [2022-11-21 17:07:10,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:10,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595358506] [2022-11-21 17:07:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:10,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:10,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:10,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:10,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:10,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:10,697 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-21 17:07:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:10,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595358506] [2022-11-21 17:07:10,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595358506] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:10,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:10,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:10,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137034020] [2022-11-21 17:07:10,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:10,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:10,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:10,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:10,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:10,700 INFO L87 Difference]: Start difference. First operand 562 states and 782 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:12,242 INFO L93 Difference]: Finished difference Result 2996 states and 4324 transitions. [2022-11-21 17:07:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:07:12,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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 67 [2022-11-21 17:07:12,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:12,258 INFO L225 Difference]: With dead ends: 2996 [2022-11-21 17:07:12,258 INFO L226 Difference]: Without dead ends: 2445 [2022-11-21 17:07:12,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-11-21 17:07:12,262 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 1036 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 936 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 936 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:12,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 766 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 936 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-21 17:07:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2445 states. [2022-11-21 17:07:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2445 to 1559. [2022-11-21 17:07:12,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1314 states have (on average 1.3987823439878235) internal successors, (1838), 1332 states have internal predecessors, (1838), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-11-21 17:07:12,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2171 transitions. [2022-11-21 17:07:12,469 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2171 transitions. Word has length 67 [2022-11-21 17:07:12,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:12,469 INFO L495 AbstractCegarLoop]: Abstraction has 1559 states and 2171 transitions. [2022-11-21 17:07:12,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 5 states have internal predecessors, (57), 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-21 17:07:12,469 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2171 transitions. [2022-11-21 17:07:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 17:07:12,471 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:12,471 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:12,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:07:12,472 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:12,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:12,472 INFO L85 PathProgramCache]: Analyzing trace with hash 918077039, now seen corresponding path program 1 times [2022-11-21 17:07:12,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:12,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167408438] [2022-11-21 17:07:12,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:12,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:12,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:12,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:12,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:07:12,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:12,597 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:07:12,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:12,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167408438] [2022-11-21 17:07:12,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167408438] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:12,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:12,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:12,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510932448] [2022-11-21 17:07:12,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:12,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:12,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:12,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:12,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:12,600 INFO L87 Difference]: Start difference. First operand 1559 states and 2171 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-21 17:07:13,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:13,414 INFO L93 Difference]: Finished difference Result 3474 states and 4944 transitions. [2022-11-21 17:07:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:07:13,415 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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 84 [2022-11-21 17:07:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:13,425 INFO L225 Difference]: With dead ends: 3474 [2022-11-21 17:07:13,425 INFO L226 Difference]: Without dead ends: 1926 [2022-11-21 17:07:13,429 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2022-11-21 17:07:13,430 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 176 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:13,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 531 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:07:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1926 states. [2022-11-21 17:07:13,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1926 to 1589. [2022-11-21 17:07:13,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1344 states have (on average 1.3861607142857142) internal successors, (1863), 1362 states have internal predecessors, (1863), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-11-21 17:07:13,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2196 transitions. [2022-11-21 17:07:13,646 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2196 transitions. Word has length 84 [2022-11-21 17:07:13,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:13,646 INFO L495 AbstractCegarLoop]: Abstraction has 1589 states and 2196 transitions. [2022-11-21 17:07:13,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 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-21 17:07:13,647 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2196 transitions. [2022-11-21 17:07:13,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 17:07:13,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:13,649 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:13,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:07:13,649 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:13,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:13,650 INFO L85 PathProgramCache]: Analyzing trace with hash 564988657, now seen corresponding path program 1 times [2022-11-21 17:07:13,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:13,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611846241] [2022-11-21 17:07:13,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:13,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:13,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:07:13,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:07:13,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:13,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611846241] [2022-11-21 17:07:13,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611846241] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:13,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:13,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:13,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812868381] [2022-11-21 17:07:13,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:13,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:13,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:13,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:13,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:13,767 INFO L87 Difference]: Start difference. First operand 1589 states and 2196 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:07:14,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:14,384 INFO L93 Difference]: Finished difference Result 3422 states and 4752 transitions. [2022-11-21 17:07:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:07:14,384 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-11-21 17:07:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:14,393 INFO L225 Difference]: With dead ends: 3422 [2022-11-21 17:07:14,393 INFO L226 Difference]: Without dead ends: 1845 [2022-11-21 17:07:14,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:07:14,398 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 341 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:14,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 376 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:07:14,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1845 states. [2022-11-21 17:07:14,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1845 to 1577. [2022-11-21 17:07:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1332 states have (on average 1.3626126126126126) internal successors, (1815), 1350 states have internal predecessors, (1815), 144 states have call successors, (144), 88 states have call predecessors, (144), 100 states have return successors, (189), 142 states have call predecessors, (189), 144 states have call successors, (189) [2022-11-21 17:07:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2148 transitions. [2022-11-21 17:07:14,623 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2148 transitions. Word has length 84 [2022-11-21 17:07:14,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:14,624 INFO L495 AbstractCegarLoop]: Abstraction has 1577 states and 2148 transitions. [2022-11-21 17:07:14,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:07:14,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2148 transitions. [2022-11-21 17:07:14,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 17:07:14,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:14,626 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:14,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:07:14,627 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:14,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:14,627 INFO L85 PathProgramCache]: Analyzing trace with hash 813135151, now seen corresponding path program 1 times [2022-11-21 17:07:14,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:14,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41869378] [2022-11-21 17:07:14,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:14,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:14,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:14,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:07:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:14,770 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:07:14,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:14,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41869378] [2022-11-21 17:07:14,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41869378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:14,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:14,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:07:14,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598525207] [2022-11-21 17:07:14,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:14,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:07:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:14,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:07:14,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:07:14,773 INFO L87 Difference]: Start difference. First operand 1577 states and 2148 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:07:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:15,959 INFO L93 Difference]: Finished difference Result 2572 states and 3512 transitions. [2022-11-21 17:07:15,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 17:07:15,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-11-21 17:07:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:15,969 INFO L225 Difference]: With dead ends: 2572 [2022-11-21 17:07:15,969 INFO L226 Difference]: Without dead ends: 1597 [2022-11-21 17:07:15,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2022-11-21 17:07:15,973 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 509 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 519 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:15,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [519 Valid, 586 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 17:07:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2022-11-21 17:07:16,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1258. [2022-11-21 17:07:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1061 states have (on average 1.349670122525919) internal successors, (1432), 1072 states have internal predecessors, (1432), 119 states have call successors, (119), 71 states have call predecessors, (119), 77 states have return successors, (140), 116 states have call predecessors, (140), 119 states have call successors, (140) [2022-11-21 17:07:16,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1691 transitions. [2022-11-21 17:07:16,166 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1691 transitions. Word has length 84 [2022-11-21 17:07:16,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:16,167 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 1691 transitions. [2022-11-21 17:07:16,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:07:16,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1691 transitions. [2022-11-21 17:07:16,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 17:07:16,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:16,169 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:16,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:07:16,169 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1236781873, now seen corresponding path program 1 times [2022-11-21 17:07:16,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:16,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908603462] [2022-11-21 17:07:16,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:16,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:16,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:16,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:16,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:07:16,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:16,326 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:07:16,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:16,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908603462] [2022-11-21 17:07:16,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908603462] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:16,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:16,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:07:16,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530415222] [2022-11-21 17:07:16,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:16,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:07:16,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:16,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:07:16,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:07:16,328 INFO L87 Difference]: Start difference. First operand 1258 states and 1691 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:07:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:17,391 INFO L93 Difference]: Finished difference Result 2777 states and 3732 transitions. [2022-11-21 17:07:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-21 17:07:17,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 84 [2022-11-21 17:07:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:17,399 INFO L225 Difference]: With dead ends: 2777 [2022-11-21 17:07:17,399 INFO L226 Difference]: Without dead ends: 1622 [2022-11-21 17:07:17,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2022-11-21 17:07:17,403 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 635 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:17,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 506 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:07:17,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2022-11-21 17:07:17,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1246. [2022-11-21 17:07:17,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1246 states, 1052 states have (on average 1.3450570342205324) internal successors, (1415), 1060 states have internal predecessors, (1415), 119 states have call successors, (119), 71 states have call predecessors, (119), 74 states have return successors, (133), 115 states have call predecessors, (133), 119 states have call successors, (133) [2022-11-21 17:07:17,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1246 states to 1246 states and 1667 transitions. [2022-11-21 17:07:17,571 INFO L78 Accepts]: Start accepts. Automaton has 1246 states and 1667 transitions. Word has length 84 [2022-11-21 17:07:17,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:17,573 INFO L495 AbstractCegarLoop]: Abstraction has 1246 states and 1667 transitions. [2022-11-21 17:07:17,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:07:17,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1246 states and 1667 transitions. [2022-11-21 17:07:17,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-11-21 17:07:17,577 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:17,577 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:17,578 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:07:17,578 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash -608585293, now seen corresponding path program 1 times [2022-11-21 17:07:17,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:17,579 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876731558] [2022-11-21 17:07:17,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:17,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:17,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:07:17,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-21 17:07:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:17,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876731558] [2022-11-21 17:07:17,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876731558] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:17,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248521366] [2022-11-21 17:07:17,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:17,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:17,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:17,695 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:17,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:07:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:17,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:07:17,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:07:17,882 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:17,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248521366] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:17,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:17,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-21 17:07:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508393523] [2022-11-21 17:07:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:17,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:17,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:17,884 INFO L87 Difference]: Start difference. First operand 1246 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-21 17:07:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:18,293 INFO L93 Difference]: Finished difference Result 2883 states and 3926 transitions. [2022-11-21 17:07:18,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:18,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 84 [2022-11-21 17:07:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:18,304 INFO L225 Difference]: With dead ends: 2883 [2022-11-21 17:07:18,304 INFO L226 Difference]: Without dead ends: 2039 [2022-11-21 17:07:18,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:18,309 INFO L413 NwaCegarLoop]: 307 mSDtfsCounter, 129 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:18,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 474 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:07:18,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2022-11-21 17:07:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2039. [2022-11-21 17:07:18,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2039 states, 1721 states have (on average 1.335270191748983) internal successors, (2298), 1731 states have internal predecessors, (2298), 194 states have call successors, (194), 118 states have call predecessors, (194), 123 states have return successors, (258), 190 states have call predecessors, (258), 194 states have call successors, (258) [2022-11-21 17:07:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2039 states to 2039 states and 2750 transitions. [2022-11-21 17:07:18,620 INFO L78 Accepts]: Start accepts. Automaton has 2039 states and 2750 transitions. Word has length 84 [2022-11-21 17:07:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:18,621 INFO L495 AbstractCegarLoop]: Abstraction has 2039 states and 2750 transitions. [2022-11-21 17:07:18,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-21 17:07:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2039 states and 2750 transitions. [2022-11-21 17:07:18,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 17:07:18,623 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:18,623 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:18,632 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:18,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:18,829 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:18,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:18,830 INFO L85 PathProgramCache]: Analyzing trace with hash -55730782, now seen corresponding path program 1 times [2022-11-21 17:07:18,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:18,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850670209] [2022-11-21 17:07:18,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:18,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:18,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:18,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:18,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:18,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:18,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:18,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 17:07:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:19,032 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 17:07:19,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:19,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850670209] [2022-11-21 17:07:19,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850670209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:19,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:19,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:07:19,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779207884] [2022-11-21 17:07:19,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:19,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:07:19,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:19,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:07:19,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:19,035 INFO L87 Difference]: Start difference. First operand 2039 states and 2750 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 17:07:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:20,337 INFO L93 Difference]: Finished difference Result 6620 states and 9061 transitions. [2022-11-21 17:07:20,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:07:20,338 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-11-21 17:07:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:20,361 INFO L225 Difference]: With dead ends: 6620 [2022-11-21 17:07:20,361 INFO L226 Difference]: Without dead ends: 4593 [2022-11-21 17:07:20,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-11-21 17:07:20,369 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 640 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:20,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 458 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:07:20,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-11-21 17:07:21,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 4197. [2022-11-21 17:07:21,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4197 states, 3533 states have (on average 1.3102179450891593) internal successors, (4629), 3587 states have internal predecessors, (4629), 366 states have call successors, (366), 230 states have call predecessors, (366), 297 states have return successors, (707), 381 states have call predecessors, (707), 366 states have call successors, (707) [2022-11-21 17:07:21,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4197 states to 4197 states and 5702 transitions. [2022-11-21 17:07:21,174 INFO L78 Accepts]: Start accepts. Automaton has 4197 states and 5702 transitions. Word has length 99 [2022-11-21 17:07:21,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:21,175 INFO L495 AbstractCegarLoop]: Abstraction has 4197 states and 5702 transitions. [2022-11-21 17:07:21,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 17:07:21,175 INFO L276 IsEmpty]: Start isEmpty. Operand 4197 states and 5702 transitions. [2022-11-21 17:07:21,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-21 17:07:21,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:21,178 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:21,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:07:21,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:21,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:21,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1996312796, now seen corresponding path program 1 times [2022-11-21 17:07:21,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:21,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685351341] [2022-11-21 17:07:21,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:21,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:21,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 17:07:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:21,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:21,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 17:07:21,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:21,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685351341] [2022-11-21 17:07:21,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685351341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:21,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:21,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:07:21,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584644615] [2022-11-21 17:07:21,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:21,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:07:21,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:21,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:07:21,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:07:21,264 INFO L87 Difference]: Start difference. First operand 4197 states and 5702 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 17:07:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:22,185 INFO L93 Difference]: Finished difference Result 8948 states and 12144 transitions. [2022-11-21 17:07:22,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:07:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 99 [2022-11-21 17:07:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:22,237 INFO L225 Difference]: With dead ends: 8948 [2022-11-21 17:07:22,237 INFO L226 Difference]: Without dead ends: 4762 [2022-11-21 17:07:22,250 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:07:22,251 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 337 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:22,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 232 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:07:22,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4762 states. [2022-11-21 17:07:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4762 to 4192. [2022-11-21 17:07:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4192 states, 3531 states have (on average 1.3101104502973662) internal successors, (4626), 3584 states have internal predecessors, (4626), 363 states have call successors, (363), 230 states have call predecessors, (363), 297 states have return successors, (703), 378 states have call predecessors, (703), 363 states have call successors, (703) [2022-11-21 17:07:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4192 states to 4192 states and 5692 transitions. [2022-11-21 17:07:23,049 INFO L78 Accepts]: Start accepts. Automaton has 4192 states and 5692 transitions. Word has length 99 [2022-11-21 17:07:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:23,050 INFO L495 AbstractCegarLoop]: Abstraction has 4192 states and 5692 transitions. [2022-11-21 17:07:23,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-11-21 17:07:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 4192 states and 5692 transitions. [2022-11-21 17:07:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-21 17:07:23,052 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:23,053 INFO L195 NwaCegarLoop]: trace histogram [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-21 17:07:23,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 17:07:23,053 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:23,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1243137275, now seen corresponding path program 1 times [2022-11-21 17:07:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:23,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018214049] [2022-11-21 17:07:23,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:23,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-21 17:07:23,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:23,147 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-11-21 17:07:23,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:23,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018214049] [2022-11-21 17:07:23,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018214049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:23,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:23,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:07:23,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644278170] [2022-11-21 17:07:23,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:23,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:07:23,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:23,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:07:23,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:07:23,150 INFO L87 Difference]: Start difference. First operand 4192 states and 5692 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 17:07:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:24,435 INFO L93 Difference]: Finished difference Result 9970 states and 13687 transitions. [2022-11-21 17:07:24,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:07:24,436 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 100 [2022-11-21 17:07:24,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:24,466 INFO L225 Difference]: With dead ends: 9970 [2022-11-21 17:07:24,466 INFO L226 Difference]: Without dead ends: 6565 [2022-11-21 17:07:24,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:07:24,478 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 438 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:24,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 319 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:07:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6565 states. [2022-11-21 17:07:25,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6565 to 5725. [2022-11-21 17:07:25,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5725 states, 4816 states have (on average 1.3054401993355482) internal successors, (6287), 4881 states have internal predecessors, (6287), 504 states have call successors, (504), 321 states have call predecessors, (504), 404 states have return successors, (923), 523 states have call predecessors, (923), 504 states have call successors, (923) [2022-11-21 17:07:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5725 states to 5725 states and 7714 transitions. [2022-11-21 17:07:25,491 INFO L78 Accepts]: Start accepts. Automaton has 5725 states and 7714 transitions. Word has length 100 [2022-11-21 17:07:25,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:25,492 INFO L495 AbstractCegarLoop]: Abstraction has 5725 states and 7714 transitions. [2022-11-21 17:07:25,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 17:07:25,493 INFO L276 IsEmpty]: Start isEmpty. Operand 5725 states and 7714 transitions. [2022-11-21 17:07:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-21 17:07:25,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:25,498 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:25,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 17:07:25,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:25,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:25,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1869458483, now seen corresponding path program 1 times [2022-11-21 17:07:25,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:25,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682558452] [2022-11-21 17:07:25,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:25,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:25,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:25,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:25,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:25,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:07:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 17:07:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:25,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,614 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:07:25,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:25,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682558452] [2022-11-21 17:07:25,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682558452] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:25,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1000628647] [2022-11-21 17:07:25,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:25,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:25,615 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:25,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:25,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:07:25,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:25,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:07:25,717 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:25,860 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 17:07:25,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:25,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1000628647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:25,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:25,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2022-11-21 17:07:25,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715663470] [2022-11-21 17:07:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:25,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:25,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:25,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:25,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:25,863 INFO L87 Difference]: Start difference. First operand 5725 states and 7714 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 17:07:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:26,752 INFO L93 Difference]: Finished difference Result 13443 states and 18129 transitions. [2022-11-21 17:07:26,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:26,752 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 117 [2022-11-21 17:07:26,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:26,789 INFO L225 Difference]: With dead ends: 13443 [2022-11-21 17:07:26,789 INFO L226 Difference]: Without dead ends: 7715 [2022-11-21 17:07:26,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:26,812 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 86 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:26,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 368 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:26,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7715 states. [2022-11-21 17:07:27,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7715 to 7649. [2022-11-21 17:07:27,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7649 states, 6430 states have (on average 1.3021772939346812) internal successors, (8373), 6510 states have internal predecessors, (8373), 682 states have call successors, (682), 438 states have call predecessors, (682), 536 states have return successors, (1154), 701 states have call predecessors, (1154), 682 states have call successors, (1154) [2022-11-21 17:07:27,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7649 states to 7649 states and 10209 transitions. [2022-11-21 17:07:27,716 INFO L78 Accepts]: Start accepts. Automaton has 7649 states and 10209 transitions. Word has length 117 [2022-11-21 17:07:27,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:27,716 INFO L495 AbstractCegarLoop]: Abstraction has 7649 states and 10209 transitions. [2022-11-21 17:07:27,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 17:07:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 7649 states and 10209 transitions. [2022-11-21 17:07:27,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-21 17:07:27,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:27,720 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:27,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:27,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-21 17:07:27,926 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 964798723, now seen corresponding path program 1 times [2022-11-21 17:07:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:27,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840014854] [2022-11-21 17:07:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:27,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:27,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:27,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:28,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:28,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:28,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-11-21 17:07:28,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-21 17:07:28,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:28,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,036 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:07:28,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:28,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840014854] [2022-11-21 17:07:28,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840014854] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:28,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843448097] [2022-11-21 17:07:28,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:28,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:28,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:28,038 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:28,063 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:07:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:28,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:07:28,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-21 17:07:28,263 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:28,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843448097] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:28,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:28,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-21 17:07:28,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515464416] [2022-11-21 17:07:28,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:28,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:28,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:28,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:28,266 INFO L87 Difference]: Start difference. First operand 7649 states and 10209 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 17:07:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:29,395 INFO L93 Difference]: Finished difference Result 16201 states and 22003 transitions. [2022-11-21 17:07:29,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 118 [2022-11-21 17:07:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:29,425 INFO L225 Difference]: With dead ends: 16201 [2022-11-21 17:07:29,425 INFO L226 Difference]: Without dead ends: 9348 [2022-11-21 17:07:29,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:29,442 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 121 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:29,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 221 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9348 states. [2022-11-21 17:07:31,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9348 to 9241. [2022-11-21 17:07:31,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9241 states, 7848 states have (on average 1.2719164118246686) internal successors, (9982), 7944 states have internal predecessors, (9982), 758 states have call successors, (758), 529 states have call predecessors, (758), 634 states have return successors, (1380), 768 states have call predecessors, (1380), 758 states have call successors, (1380) [2022-11-21 17:07:31,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9241 states to 9241 states and 12120 transitions. [2022-11-21 17:07:31,070 INFO L78 Accepts]: Start accepts. Automaton has 9241 states and 12120 transitions. Word has length 118 [2022-11-21 17:07:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:31,071 INFO L495 AbstractCegarLoop]: Abstraction has 9241 states and 12120 transitions. [2022-11-21 17:07:31,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (7), 2 states have call predecessors, (7), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-21 17:07:31,071 INFO L276 IsEmpty]: Start isEmpty. Operand 9241 states and 12120 transitions. [2022-11-21 17:07:31,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-21 17:07:31,076 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:31,076 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-21 17:07:31,086 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:31,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:07:31,281 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -36607372, now seen corresponding path program 1 times [2022-11-21 17:07:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:31,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815627054] [2022-11-21 17:07:31,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:31,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:07:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:07:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,425 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-21 17:07:31,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815627054] [2022-11-21 17:07:31,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815627054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:31,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [241294533] [2022-11-21 17:07:31,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:31,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:31,432 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:31,455 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:07:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:31,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:07:31,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:31,589 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:07:31,589 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:31,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [241294533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:31,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:31,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-21 17:07:31,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737865013] [2022-11-21 17:07:31,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:31,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:31,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:31,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:31,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:31,595 INFO L87 Difference]: Start difference. First operand 9241 states and 12120 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 17:07:33,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:33,210 INFO L93 Difference]: Finished difference Result 16957 states and 22181 transitions. [2022-11-21 17:07:33,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:33,210 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 121 [2022-11-21 17:07:33,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:33,243 INFO L225 Difference]: With dead ends: 16957 [2022-11-21 17:07:33,243 INFO L226 Difference]: Without dead ends: 9930 [2022-11-21 17:07:33,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:07:33,259 INFO L413 NwaCegarLoop]: 278 mSDtfsCounter, 121 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:33,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 440 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:33,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9930 states. [2022-11-21 17:07:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9930 to 9843. [2022-11-21 17:07:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9843 states, 8423 states have (on average 1.2614270449958447) internal successors, (10625), 8525 states have internal predecessors, (10625), 758 states have call successors, (758), 550 states have call predecessors, (758), 661 states have return successors, (1272), 768 states have call predecessors, (1272), 758 states have call successors, (1272) [2022-11-21 17:07:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9843 states to 9843 states and 12655 transitions. [2022-11-21 17:07:34,530 INFO L78 Accepts]: Start accepts. Automaton has 9843 states and 12655 transitions. Word has length 121 [2022-11-21 17:07:34,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:34,531 INFO L495 AbstractCegarLoop]: Abstraction has 9843 states and 12655 transitions. [2022-11-21 17:07:34,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 3 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-21 17:07:34,531 INFO L276 IsEmpty]: Start isEmpty. Operand 9843 states and 12655 transitions. [2022-11-21 17:07:34,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-21 17:07:34,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:34,537 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-11-21 17:07:34,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:34,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:34,743 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:34,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:34,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1792814822, now seen corresponding path program 1 times [2022-11-21 17:07:34,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:34,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690578245] [2022-11-21 17:07:34,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:34,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:34,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:07:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-11-21 17:07:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:34,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-21 17:07:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:34,894 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 5 proven. 39 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-21 17:07:34,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:34,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690578245] [2022-11-21 17:07:34,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690578245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:34,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568827832] [2022-11-21 17:07:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:34,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:34,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:34,897 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:34,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:07:35,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:35,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:07:35,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:07:35,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:35,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568827832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:35,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:35,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-11-21 17:07:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544813710] [2022-11-21 17:07:35,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:35,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:35,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:35,037 INFO L87 Difference]: Start difference. First operand 9843 states and 12655 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:07:37,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:37,758 INFO L93 Difference]: Finished difference Result 28741 states and 37387 transitions. [2022-11-21 17:07:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:37,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 153 [2022-11-21 17:07:37,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:37,823 INFO L225 Difference]: With dead ends: 28741 [2022-11-21 17:07:37,824 INFO L226 Difference]: Without dead ends: 18910 [2022-11-21 17:07:37,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:37,847 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 147 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:37,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 364 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:37,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18910 states. [2022-11-21 17:07:40,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18910 to 18895. [2022-11-21 17:07:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18895 states, 16195 states have (on average 1.250077184316147) internal successors, (20245), 16388 states have internal predecessors, (20245), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-11-21 17:07:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18895 states to 18895 states and 24374 transitions. [2022-11-21 17:07:40,710 INFO L78 Accepts]: Start accepts. Automaton has 18895 states and 24374 transitions. Word has length 153 [2022-11-21 17:07:40,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:40,711 INFO L495 AbstractCegarLoop]: Abstraction has 18895 states and 24374 transitions. [2022-11-21 17:07:40,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2022-11-21 17:07:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 18895 states and 24374 transitions. [2022-11-21 17:07:40,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-21 17:07:40,720 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:40,720 INFO L195 NwaCegarLoop]: trace histogram [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, 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-21 17:07:40,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:40,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:40,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:40,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:40,926 INFO L85 PathProgramCache]: Analyzing trace with hash -970215938, now seen corresponding path program 1 times [2022-11-21 17:07:40,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:40,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672967013] [2022-11-21 17:07:40,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:40,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:40,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:40,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:40,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:40,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:40,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:40,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 17:07:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:41,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:07:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:41,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:41,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 17:07:41,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:41,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 21 proven. 7 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2022-11-21 17:07:41,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:41,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672967013] [2022-11-21 17:07:41,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672967013] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:41,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993646507] [2022-11-21 17:07:41,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:41,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:41,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:41,035 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:41,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:07:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:41,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 468 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:07:41,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-21 17:07:41,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:41,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [993646507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:41,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:41,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-11-21 17:07:41,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749791774] [2022-11-21 17:07:41,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:41,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:41,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:41,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:41,199 INFO L87 Difference]: Start difference. First operand 18895 states and 24374 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 17:07:43,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:43,212 INFO L93 Difference]: Finished difference Result 29234 states and 38669 transitions. [2022-11-21 17:07:43,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:43,213 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 154 [2022-11-21 17:07:43,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:43,267 INFO L225 Difference]: With dead ends: 29234 [2022-11-21 17:07:43,267 INFO L226 Difference]: Without dead ends: 18527 [2022-11-21 17:07:43,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:43,295 INFO L413 NwaCegarLoop]: 305 mSDtfsCounter, 118 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:43,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 461 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:43,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18527 states. [2022-11-21 17:07:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18527 to 18465. [2022-11-21 17:07:45,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18465 states, 15765 states have (on average 1.238883602917856) internal successors, (19531), 15958 states have internal predecessors, (19531), 1433 states have call successors, (1433), 1059 states have call predecessors, (1433), 1266 states have return successors, (2696), 1449 states have call predecessors, (2696), 1433 states have call successors, (2696) [2022-11-21 17:07:45,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18465 states to 18465 states and 23660 transitions. [2022-11-21 17:07:45,588 INFO L78 Accepts]: Start accepts. Automaton has 18465 states and 23660 transitions. Word has length 154 [2022-11-21 17:07:45,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:45,589 INFO L495 AbstractCegarLoop]: Abstraction has 18465 states and 23660 transitions. [2022-11-21 17:07:45,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 17:07:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 18465 states and 23660 transitions. [2022-11-21 17:07:45,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-21 17:07:45,599 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:45,599 INFO L195 NwaCegarLoop]: trace histogram [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, 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] [2022-11-21 17:07:45,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:07:45,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:45,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:45,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:45,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1358937995, now seen corresponding path program 1 times [2022-11-21 17:07:45,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:45,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704083471] [2022-11-21 17:07:45,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:45,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:45,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:45,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:45,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 17:07:45,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:07:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 17:07:45,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:45,908 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-21 17:07:45,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:45,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704083471] [2022-11-21 17:07:45,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704083471] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:45,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:45,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:07:45,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259105002] [2022-11-21 17:07:45,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:45,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:07:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:45,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:07:45,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:45,911 INFO L87 Difference]: Start difference. First operand 18465 states and 23660 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 17:07:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:49,575 INFO L93 Difference]: Finished difference Result 33725 states and 43529 transitions. [2022-11-21 17:07:49,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:07:49,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 155 [2022-11-21 17:07:49,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:49,640 INFO L225 Difference]: With dead ends: 33725 [2022-11-21 17:07:49,641 INFO L226 Difference]: Without dead ends: 17956 [2022-11-21 17:07:49,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:07:49,686 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 587 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:49,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 522 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:07:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17956 states. [2022-11-21 17:07:51,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17956 to 16098. [2022-11-21 17:07:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16098 states, 13792 states have (on average 1.2261455916473318) internal successors, (16911), 13972 states have internal predecessors, (16911), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-11-21 17:07:51,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16098 states to 16098 states and 20177 transitions. [2022-11-21 17:07:51,738 INFO L78 Accepts]: Start accepts. Automaton has 16098 states and 20177 transitions. Word has length 155 [2022-11-21 17:07:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:51,739 INFO L495 AbstractCegarLoop]: Abstraction has 16098 states and 20177 transitions. [2022-11-21 17:07:51,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 3 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 17:07:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 16098 states and 20177 transitions. [2022-11-21 17:07:51,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-21 17:07:51,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:51,746 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1] [2022-11-21 17:07:51,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 17:07:51,747 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:51,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:51,747 INFO L85 PathProgramCache]: Analyzing trace with hash 217702764, now seen corresponding path program 1 times [2022-11-21 17:07:51,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:51,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929915632] [2022-11-21 17:07:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:51,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:51,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:51,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 17:07:51,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:07:51,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:51,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 17:07:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 37 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2022-11-21 17:07:51,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:51,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929915632] [2022-11-21 17:07:51,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929915632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:07:51,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039596105] [2022-11-21 17:07:51,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:51,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:51,859 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:07:51,860 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:07:51,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:07:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:51,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:07:51,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:07:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-21 17:07:52,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:07:52,078 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039596105] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:52,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:07:52,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 6 [2022-11-21 17:07:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368165126] [2022-11-21 17:07:52,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:52,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:07:52,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:52,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:07:52,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:52,080 INFO L87 Difference]: Start difference. First operand 16098 states and 20177 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 17:07:53,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:07:53,997 INFO L93 Difference]: Finished difference Result 28643 states and 36407 transitions. [2022-11-21 17:07:53,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:07:53,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) Word has length 156 [2022-11-21 17:07:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:07:54,042 INFO L225 Difference]: With dead ends: 28643 [2022-11-21 17:07:54,042 INFO L226 Difference]: Without dead ends: 16151 [2022-11-21 17:07:54,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:07:54,066 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 90 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:07:54,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:07:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16151 states. [2022-11-21 17:07:56,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16151 to 16082. [2022-11-21 17:07:56,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16082 states, 13776 states have (on average 1.2047038327526132) internal successors, (16596), 13956 states have internal predecessors, (16596), 1207 states have call successors, (1207), 894 states have call predecessors, (1207), 1098 states have return successors, (2059), 1233 states have call predecessors, (2059), 1207 states have call successors, (2059) [2022-11-21 17:07:56,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16082 states to 16082 states and 19862 transitions. [2022-11-21 17:07:56,223 INFO L78 Accepts]: Start accepts. Automaton has 16082 states and 19862 transitions. Word has length 156 [2022-11-21 17:07:56,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:07:56,224 INFO L495 AbstractCegarLoop]: Abstraction has 16082 states and 19862 transitions. [2022-11-21 17:07:56,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 17:07:56,224 INFO L276 IsEmpty]: Start isEmpty. Operand 16082 states and 19862 transitions. [2022-11-21 17:07:56,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-11-21 17:07:56,232 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:07:56,232 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1] [2022-11-21 17:07:56,238 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-21 17:07:56,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:07:56,438 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:07:56,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:07:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1852604969, now seen corresponding path program 2 times [2022-11-21 17:07:56,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:07:56,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445430557] [2022-11-21 17:07:56,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:07:56,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:07:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-21 17:07:56,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:07:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-21 17:07:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-21 17:07:56,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-21 17:07:56,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 17:07:56,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-11-21 17:07:56,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 17:07:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:07:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:07:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2022-11-21 17:07:56,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:07:56,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445430557] [2022-11-21 17:07:56,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445430557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:07:56,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:07:56,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:07:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341571573] [2022-11-21 17:07:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:07:56,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:07:56,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:07:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:07:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:07:56,620 INFO L87 Difference]: Start difference. First operand 16082 states and 19862 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-21 17:08:00,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:08:00,720 INFO L93 Difference]: Finished difference Result 40643 states and 51929 transitions. [2022-11-21 17:08:00,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 17:08:00,721 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 156 [2022-11-21 17:08:00,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:08:00,766 INFO L225 Difference]: With dead ends: 40643 [2022-11-21 17:08:00,766 INFO L226 Difference]: Without dead ends: 24579 [2022-11-21 17:08:00,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2022-11-21 17:08:00,792 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 963 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 975 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-21 17:08:00,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [975 Valid, 440 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-21 17:08:00,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24579 states. [2022-11-21 17:08:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24579 to 23029. [2022-11-21 17:08:03,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19688 states have (on average 1.1473994311255586) internal successors, (22590), 20035 states have internal predecessors, (22590), 1643 states have call successors, (1643), 1326 states have call predecessors, (1643), 1697 states have return successors, (3030), 1669 states have call predecessors, (3030), 1643 states have call successors, (3030) [2022-11-21 17:08:03,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 27263 transitions. [2022-11-21 17:08:03,764 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 27263 transitions. Word has length 156 [2022-11-21 17:08:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:08:03,765 INFO L495 AbstractCegarLoop]: Abstraction has 23029 states and 27263 transitions. [2022-11-21 17:08:03,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 6 states have internal predecessors, (106), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-21 17:08:03,765 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 27263 transitions. [2022-11-21 17:08:03,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-21 17:08:03,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:08:03,774 INFO L195 NwaCegarLoop]: trace histogram [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, 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, 1, 1] [2022-11-21 17:08:03,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 17:08:03,775 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:08:03,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:08:03,776 INFO L85 PathProgramCache]: Analyzing trace with hash -217774742, now seen corresponding path program 1 times [2022-11-21 17:08:03,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:08:03,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968743625] [2022-11-21 17:08:03,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:08:03,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:08:03,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:08:03,795 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:08:03,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:08:03,869 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:08:03,869 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:08:03,870 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-21 17:08:03,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 17:08:03,876 INFO L444 BasicCegarLoop]: Path program histogram: [2, 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-21 17:08:03,882 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:08:04,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:08:04 BoogieIcfgContainer [2022-11-21 17:08:04,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:08:04,017 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:08:04,017 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:08:04,017 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:08:04,018 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:07:02" (3/4) ... [2022-11-21 17:08:04,020 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 17:08:04,155 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:08:04,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:08:04,157 INFO L158 Benchmark]: Toolchain (without parser) took 62862.20ms. Allocated memory was 157.3MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 112.2MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 230.8MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,157 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 157.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:08:04,158 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.68ms. Allocated memory is still 157.3MB. Free memory was 111.6MB in the beginning and 97.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,158 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.25ms. Allocated memory is still 157.3MB. Free memory was 97.9MB in the beginning and 96.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,158 INFO L158 Benchmark]: Boogie Preprocessor took 32.21ms. Allocated memory is still 157.3MB. Free memory was 96.2MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,159 INFO L158 Benchmark]: RCFGBuilder took 619.83ms. Allocated memory is still 157.3MB. Free memory was 94.2MB in the beginning and 74.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,159 INFO L158 Benchmark]: TraceAbstraction took 61658.27ms. Allocated memory was 157.3MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 73.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 178.4MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,162 INFO L158 Benchmark]: Witness Printer took 139.00ms. Allocated memory is still 4.7GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-21 17:08:04,170 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 157.3MB. Free memory is still 129.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.68ms. Allocated memory is still 157.3MB. Free memory was 111.6MB in the beginning and 97.9MB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.25ms. Allocated memory is still 157.3MB. Free memory was 97.9MB in the beginning and 96.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.21ms. Allocated memory is still 157.3MB. Free memory was 96.2MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 619.83ms. Allocated memory is still 157.3MB. Free memory was 94.2MB in the beginning and 74.6MB in the end (delta: 19.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 61658.27ms. Allocated memory was 157.3MB in the beginning and 4.7GB in the end (delta: 4.5GB). Free memory was 73.8MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 178.4MB. Max. memory is 16.1GB. * Witness Printer took 139.00ms. Allocated memory is still 4.7GB. Free memory was 4.4GB in the beginning and 4.4GB in the end (delta: 13.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L25] int m_pc = 0; [L26] int t1_pc = 0; [L27] int t2_pc = 0; [L28] int m_st ; [L29] int t1_st ; [L30] int t2_st ; [L31] int m_i ; [L32] int t1_i ; [L33] int t2_i ; [L34] int M_E = 2; [L35] int T1_E = 2; [L36] int T2_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L573] int __retres1 ; [L577] CALL init_model() [L487] m_i = 1 [L488] t1_i = 1 [L489] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L577] RET init_model() [L578] CALL start_simulation() [L514] int kernel_st ; [L515] int tmp ; [L516] int tmp___0 ; [L520] kernel_st = 0 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] FCALL update_channels() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] CALL init_threads() [L221] COND TRUE m_i == 1 [L222] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L226] COND TRUE t1_i == 1 [L227] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] COND TRUE t2_i == 1 [L232] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L522] RET init_threads() [L523] CALL fire_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(T2_E == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L349] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L354] COND FALSE !(E_2 == 0) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L523] RET fire_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L524] CALL activate_threads() VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L166] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L168] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L185] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L187] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] COND FALSE !(t2_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L204] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L206] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, \result=0, __retres1=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=0, \old(t1_st)=0, \old(t2_st)=0, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, tmp___1=0] [L524] RET activate_threads() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] CALL reset_delta_events() VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(T2_E == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L382] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] COND FALSE !(E_2 == 1) VAL [\old(E_1)=2, \old(E_2)=2, \old(M_E)=2, \old(T1_E)=2, \old(T2_E)=2, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L525] RET reset_delta_events() VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L528] COND TRUE 1 VAL [E_1=2, E_2=2, kernel_st=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L531] kernel_st = 1 [L532] CALL eval() [L267] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, tmp=1, tmp_ndt_1=0] [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L134] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L136] t2_pc = 1 [L137] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L315] RET transmit2() [L271] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] CALL, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L241] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L244] COND TRUE m_st == 0 [L245] __retres1 = 1 VAL [__retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L262] return (__retres1); VAL [\result=1, __retres1=1, E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L274] RET, EXPR exists_runnable_thread() VAL [E_1=2, E_2=2, exists_runnable_thread()=1, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L274] tmp = exists_runnable_thread() [L276] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, tmp_ndt_3=1] [L281] COND TRUE m_st == 0 [L282] int tmp_ndt_1; [L283] tmp_ndt_1 = __VERIFIER_nondet_int() [L284] COND TRUE \read(tmp_ndt_1) [L286] m_st = 1 [L287] CALL master() [L47] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L61] E_1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND TRUE E_1 == 1 [L177] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=1, __retres1=1, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND TRUE \read(tmp___0) [L414] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND FALSE !(E_2 == 1) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L204] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, \result=0, __retres1=0, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND FALSE !(\read(tmp___1)) VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=1, tmp___1=0] [L435] RET activate_threads() VAL [\old(m_st)=1, \old(t1_st)=2, \old(t2_st)=2, E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L62] RET immediate_notify() VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L63] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L66] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L68] m_pc = 1 [L69] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L287] RET master() [L295] COND TRUE t1_st == 0 [L296] int tmp_ndt_2; [L297] tmp_ndt_2 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_2) [L300] t1_st = 1 [L301] CALL transmit1() [L88] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L91] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L107] E_2 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L108] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L435] CALL activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L397] int tmp ; [L398] int tmp___0 ; [L399] int tmp___1 ; [L403] CALL, EXPR is_master_triggered() [L153] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L157] COND FALSE !(M_E == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L168] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L403] RET, EXPR is_master_triggered() [L403] tmp = is_master_triggered() [L405] COND FALSE !(\read(tmp)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0] [L411] CALL, EXPR is_transmit1_triggered() [L172] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L176] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L187] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=0, __retres1=0, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L411] RET, EXPR is_transmit1_triggered() [L411] tmp___0 = is_transmit1_triggered() [L413] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, tmp=0, tmp___0=0] [L419] CALL, EXPR is_transmit2_triggered() [L191] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] COND TRUE t2_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L195] COND TRUE E_2 == 1 [L196] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L206] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, \result=1, __retres1=1, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L419] RET, EXPR is_transmit2_triggered() [L419] tmp___1 = is_transmit2_triggered() [L421] COND TRUE \read(tmp___1) [L422] t2_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, tmp=0, tmp___0=0, tmp___1=1] [L435] RET activate_threads() VAL [\old(m_st)=2, \old(t1_st)=1, \old(t2_st)=2, E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L108] RET immediate_notify() VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L109] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L101] t1_pc = 1 [L102] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L301] RET transmit1() [L309] COND TRUE t2_st == 0 [L310] int tmp_ndt_3; [L311] tmp_ndt_3 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_3) [L314] t2_st = 1 [L315] CALL transmit2() [L123] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L126] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L142] CALL error() [L21] reach_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 128 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.5s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8938 SdHoareTripleChecker+Valid, 9.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8751 mSDsluCounter, 11110 SdHoareTripleChecker+Invalid, 8.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7022 mSDsCounter, 1211 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9890 IncrementalHoareTripleChecker+Invalid, 11101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1211 mSolverCounterUnsat, 4088 mSDtfsCounter, 9890 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1550 GetRequests, 1301 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23029occurred in iteration=24, InterpolantAutomatonStates: 230, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 20.5s AutomataMinimizationTime, 24 MinimizatonAttempts, 8602 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 3444 NumberOfCodeBlocks, 3444 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3256 ConstructedInterpolants, 0 QuantifiedInterpolants, 6672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2763 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 31 InterpolantComputations, 24 PerfectInterpolantSequences, 865/990 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-21 17:08:04,207 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_acf115a1-0b15-480b-9fb2-494c9b1879ba/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE